automaton Namespace Reference

Namespaces
namespace	convert
namespace	determinize
namespace	generate
namespace	properties
namespace	run
namespace	simplify
namespace	transform

Data Structures
class	ArcFactoredDeterministicZAutomaton
	Deterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages. More...
class	ArcFactoredNondeterministicZAutomaton
	Nondeterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree languages. More...
class	AutomatonException
class	AutomatonFromStringLexer
struct	AutomatonFromStringParserCommon
class	AutomatonFromXMLParser
class	AutomatonNormalize
struct	AutomatonToStringComposerCommon
class	AutomatonToXMLComposer
class	CompactDFA
	Compact deterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions. More...
class	CompactNFA
	Compact nondeterministic finite automaton. Accepts regular languages. The automaton has a list of symbols on transitions. More...
class	DFA
	Deterministic finite automaton. Accepts regular languages. More...
class	DFTA
	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	DPDA
	Deterministic pushdown automaton. Accepts subset of context free languages. More...
class	EpsilonNFA
	Epsilon nondeterministic finite automaton. Accepts regular languages. More...
class	EpsilonNFTA
	Epsilon nondeterministic finite tree automaton. Accepts regular tree languages. More...
class	ExtendedNFA
	Extended nondeterministic finite automaton. Accepts regular languages. The automaton has a regular expression on transitions. More...
class	ExtendedNFTA
	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	InputDrivenDPDA
	Deterministic input driven pushdown automaton. Accepts subset of context free languages. More...
class	InputDrivenNPDA
	Nondeterministic input driven pushdown automaton. Accepts subset of context free languages. More...
class	isAFDZA_impl
class	isAFDZA_impl< ArcFactoredDeterministicZAutomaton< SymbolType, StateType > >
class	isAFNZA_impl
class	isAFNZA_impl< ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > >
class	isCompactDFA_impl
class	isCompactDFA_impl< CompactDFA< SymbolType, StateType > >
class	isCompactNFA_impl
class	isCompactNFA_impl< CompactNFA< SymbolType, StateType > >
class	isDFA_impl
class	isDFA_impl< DFA< SymbolType, StateType > >
class	isDFTA_impl
class	isDFTA_impl< DFTA< SymbolType, StateType > >
class	isEpsilonNFA_impl
class	isEpsilonNFA_impl< EpsilonNFA< SymbolType, StateType > >
class	isEpsilonNFTA_impl
class	isEpsilonNFTA_impl< EpsilonNFTA< SymbolType, StateType > >
class	isExtendedNFA_impl
class	isExtendedNFA_impl< ExtendedNFA< SymbolType, StateType > >
class	isMultiInitialStateEpsilonNFA_impl
class	isMultiInitialStateEpsilonNFA_impl< MultiInitialStateEpsilonNFA< SymbolType, StateType > >
class	isMultiInitialStateNFA_impl
class	isMultiInitialStateNFA_impl< MultiInitialStateNFA< SymbolType, StateType > >
class	isNFA_impl
class	isNFA_impl< NFA< SymbolType, StateType > >
class	isNFTA_impl
class	isNFTA_impl< NFTA< SymbolType, StateType > >
class	isUnorderedDFTA_impl
class	isUnorderedDFTA_impl< UnorderedDFTA< SymbolType, StateType > >
class	isUnorderedNFTA_impl
class	isUnorderedNFTA_impl< UnorderedNFTA< SymbolType, StateType > >
class	MultiInitialStateEpsilonNFA
	Epsilon nondeterministic finite automaton. Accepts regular languages. More...
class	MultiInitialStateNFA
	Nondeterministic finite automaton with multiple initial states. Accepts regular languages. More...
class	NFA
	Nondeterministic finite automaton. Accepts regular languages. More...
class	NFTA
	Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	NondeterministicZAutomaton
	Nondeterministic Z-Automaton. Computation model for unranked regular tree languages. More...
class	NPDA
class	NPDTA
class	OneTapeDTM
	Deterministic single tape turing machine. Accepts recursive languages. More...
class	RealTimeHeightDeterministicDPDA
	Deterministic real time height deterministic pushdown automaton. Accepts subset of context free languages. More...
class	RealTimeHeightDeterministicNPDA
	Nondeterministic real time height deterministic pushdown automaton. Accepts subset of context free languages. More...
class	SinglePopDPDA
	Deterministic pushdown automaton requiring a symbol pop from pushdown store on each transition use. Accepts subset of context free languages. More...
class	SinglePopNPDA
class	UnorderedDFTA
	Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	UnorderedNFTA
	Nondeterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
class	VisiblyPushdownDPDA
	Deterministic visibly pushdown automaton. Accepts subset of context free languages. More...
class	VisiblyPushdownNPDA
	Nondeterministic visibly pushdown automaton. Accepts subset of context free languages. More...

Enumerations
enum class	Shift { LEFT , RIGHT , NONE }

Functions
automaton::Shift	shiftFromString (const std::string &shift)
std::string	shiftToString (automaton::Shift shift)
ext::ostream &	operator<< (ext::ostream &out, const automaton::Shift &)

Variables
template<class T >
constexpr bool	isCompactDFA = isCompactDFA_impl < T > { }
template<class T >
constexpr bool	isCompactNFA = isCompactNFA_impl < T > { }
template<class T >
constexpr bool	isDFA = isDFA_impl < T > { }
template<class T >
constexpr bool	isExtendedNFA = isExtendedNFA_impl < T > { }
template<class T >
constexpr bool	isMultiInitialStateNFA = isMultiInitialStateNFA_impl < T > { }
template<class T >
constexpr bool	isNFA = isNFA_impl < T > { }
template<class T >
constexpr bool	isAFDZA = isAFDZA_impl < T > { }
template<class T >
constexpr bool	isAFNZA = isAFNZA_impl < T > { }
template<class T >
constexpr bool	isDFTA = isDFTA_impl < T > { }
template<class T >
constexpr bool	isNFTA = isNFTA_impl < T > { }
template<class T >
constexpr bool	isUnorderedDFTA = isUnorderedDFTA_impl < T > { }
template<class T >
constexpr bool	isUnorderedNFTA = isUnorderedNFTA_impl < T > { }
template<class T >
constexpr bool	isEpsilonNFA = isEpsilonNFA_impl < T > { }
template<class T >
constexpr bool	isMultiInitialStateEpsilonNFA = isMultiInitialStateEpsilonNFA_impl < T > { }
template<class T >
constexpr bool	isEpsilonNFTA = isEpsilonNFTA_impl < T > { }

Enumeration Type Documentation

Shift

enum class automaton::Shift

strong

Represent movement of the reading head in the Turing machine.

Enumerator
LEFT
RIGHT
NONE

Function Documentation

operator<<()

ext::ostream & automaton::operator<<	(	ext::ostream &	out,
		const automaton::Shift &
	)

shiftFromString()

automaton::Shift automaton::shiftFromString

(

const std::string &

shift

)

Here is the caller graph for this function:

shiftToString()

std::string automaton::shiftToString

(

automaton::Shift

shift

)

Here is the caller graph for this function:

Variable Documentation

isAFDZA

template<class T >

constexpr bool automaton::isAFDZA = isAFDZA_impl < T > { }

constexpr

Constexpr true if the type parameter T is AFDZA, false otherwise.

Template Parameters

T	the tested type parameter

isAFNZA

template<class T >

constexpr bool automaton::isAFNZA = isAFNZA_impl < T > { }

constexpr

Constexpr true if the type parameter T is AFNZA, false otherwise.

Template Parameters

T	the tested type parameter

isCompactDFA

template<class T >

constexpr bool automaton::isCompactDFA = isCompactDFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is CompactDFA, false otherwise.

Template Parameters

T	the tested type parameter

isCompactNFA

template<class T >

constexpr bool automaton::isCompactNFA = isCompactNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is CompactNFA, false otherwise.

Template Parameters

T	the tested type parameter

isDFA

template<class T >

constexpr bool automaton::isDFA = isDFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is DFA, false otherwise.

Template Parameters

T	the tested type parameter

isDFTA

template<class T >

constexpr bool automaton::isDFTA = isDFTA_impl < T > { }

constexpr

Constexpr true if the type parameter T is DFTA, false otherwise.

Template Parameters

T	the tested type parameter

isEpsilonNFA

template<class T >

constexpr bool automaton::isEpsilonNFA = isEpsilonNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is EpsilonNFA, false otherwise.

Template Parameters

T	the tested type parameter

isEpsilonNFTA

template<class T >

constexpr bool automaton::isEpsilonNFTA = isEpsilonNFTA_impl < T > { }

constexpr

Constexpr true if the type parameter T is EpsilonNFTA, false otherwise.

Template Parameters

T	the tested type parameter

isExtendedNFA

template<class T >

constexpr bool automaton::isExtendedNFA = isExtendedNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is ExtendedNFA, false otherwise.

Template Parameters

T	the tested type parameter

isMultiInitialStateEpsilonNFA

template<class T >

constexpr bool automaton::isMultiInitialStateEpsilonNFA = isMultiInitialStateEpsilonNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is MultiInitialStateEpsilonNFA, false otherwise.

Template Parameters

T	the tested type parameter

isMultiInitialStateNFA

template<class T >

constexpr bool automaton::isMultiInitialStateNFA = isMultiInitialStateNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is MultiInitialStateNFA, false otherwise.

Template Parameters

T	the tested type parameter

isNFA

template<class T >

constexpr bool automaton::isNFA = isNFA_impl < T > { }

constexpr

Constexpr true if the type parameter T is NFA, false otherwise.

Template Parameters

T	the tested type parameter

isNFTA

template<class T >

constexpr bool automaton::isNFTA = isNFTA_impl < T > { }

constexpr

Constexpr true if the type parameter T is NFTA, false otherwise.

Template Parameters

T	the tested type parameter

isUnorderedDFTA

template<class T >

constexpr bool automaton::isUnorderedDFTA = isUnorderedDFTA_impl < T > { }

constexpr

Constexpr true if the type parameter T is UnorderedDFTA, false otherwise.

Template Parameters

T	the tested type parameter

isUnorderedNFTA

template<class T >

constexpr bool automaton::isUnorderedNFTA = isUnorderedNFTA_impl < T > { }

constexpr

Constexpr true if the type parameter T is UnorderedNFTA, false otherwise.

Template Parameters

T	the tested type parameter