System.Automata Namespace Reference

Classes
class	AcceptingStates
	The set of all accepting states. More...
class	Alphabet
	A automaton alphabet More...
class	Automaton
class	FiniteAutomaton
	A deterministic Finite Automaton More...
class	MultitapeTuringMachine
class	MultitapeTuringTransition
	A transition for a Turing machine with multiple tapes. More...
class	MultitapeTuringTransitionFunction
class	NondeterministicFiniteAutomaton
	A nondeterministic Finite Automaton More...
class	NondeterministicTransitionFunction
	A nondeterministic collection of state transition mappings. More...
class	PushdownAutomaton
	A deterministic pushdown automaton utilizing a stack. More...
class	PushdownTransition
class	PushdownTransitionFunction
	A collection of state transition mappings for PDAs More...
class	StackAlphabet
	An alphabet for use with a pushdown stack More...
class	State
	A automaton state. More...
class	States
	The set of all states More...
class	TapeAlphabet
	An alphabet for use with a Turing tape More...
class	Transition
	A state transition More...
class	TransitionFunction
	A deterministic collection of state transition mappings. More...
class	TuringMachine
	A nondeterministic Turing machine More...
class	TuringTransition
	A transition for a Turing machine More...
class	TuringTransitionFunction
	A collection of state transition mappings for PDAs More...