TuringSim::Machine::FSM Namespace Reference

Namespace of finite-state machines, that is whose storage is a word. More...

Classes
class	DeterministicSimpleFiniteStateMachine
	The class to represent a deterministic finite state machine. More...
class	DeterministicSimpleFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > >
	The class to represent a deterministic finite state machine. More...
class	FiniteStateMachine
	The class to represent a finite state machine. More...
class	FiniteStateMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ >
	The class to represent a non-deterministic finite state machine. More...
class	FiniteStateMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ >
	The class to represent a deterministic finite state machine. More...
class	MaybeEpsilonFiniteStateMachine
	The class to represent a finite state machine with epsilon-transitions. More...
class	MaybeEpsilonFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > >
	The class to represent a finite state machine with epsilon-transitions. More...
class	NonDeterministicSimpleFiniteStateMachine
	The class to represent a non-deterministic finite state machine without epsilon-transitions. More...
class	NonDeterministicSimpleFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > >
	The class to represent a non-deterministic finite state machine. More...
class	SimpleFiniteStateMachine
	The class to represent a finite state machine. More...
class	SimpleFiniteStateMachine< StateType_, SymbolType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_, std::tuple< Args... > >
	The class to represent a finite state machine. More...

Typedefs
template<typename TransitionType , bool deterministic, AcceptingStyle acceptingStyle, template< typename... > class TransitionContainer = std::vector, template< typename... > class InitialStateContainer = std::set>
using	StateAcceptingFiniteStateMachine = StateAcceptingMachine< FiniteStateMachine< TransitionType, deterministic, acceptingStyle, TransitionContainer, InitialStateContainer >, acceptingStyle >
	Implementation of acceptation-related functions. More...

Detailed Description

Namespace of finite-state machines, that is whose storage is a word.

Typedef Documentation

StateAcceptingFiniteStateMachine

template<typename TransitionType , bool deterministic, AcceptingStyle acceptingStyle, template< typename... > class TransitionContainer = std::vector, template< typename... > class InitialStateContainer = std::set>

TuringSim::Machine::FSM::StateAcceptingFiniteStateMachine

Implementation of acceptation-related functions.

Template Parameters

TransitionType	the type of transitions.
deterministic	a boolean, whether the machine is expected to be deterministic.
acceptingStyle	whether the machine is alternating, regularly accepting, or not.
TransitionContainer	the container used to return matching transitions. By default, it is std::vector.
InitialStateContainer	the container used to return initial states. By default, it is std::set.

Definition at line 22 of file stateAcceptingFiniteStateMachine.h.