| CTuringSim::Machine::AcceptingMachine< TransitionType, acceptingStyle > | Base class for accepting machines |
| ►CTuringSim::Machine::AcceptingMachine< TransitionType_, acceptingStyle > | |
| ►CTuringSim::Machine::Machine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | Base class for non deterministic machines |
| CTuringSim::Machine::Amnesic::AmnesicMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a non-deterministic amnesic machine |
| CTuringSim::Machine::FSM::FiniteStateMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a non-deterministic finite state machine |
| CTuringSim::Machine::PDM::PushdownMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a non-deterministic pushdown machine |
| ►CTuringSim::Machine::Machine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | Base class for deterministic machines |
| CTuringSim::Machine::Amnesic::AmnesicMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a deterministic amnesic machine |
| CTuringSim::Machine::FSM::FiniteStateMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a deterministic finite state machine |
| CTuringSim::Machine::PDM::PushdownMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a deterministic pushdown machine |
| CTuringSim::Machine::AcceptingMachine< TransitionType_, AcceptingStyle::Accepting > | Specialization for simply accepting machines |
| CTuringSim::Machine::AcceptingMachine< TransitionType_, AcceptingStyle::Alternating > | Specialization for alternating machines |
| CTuringSim::Machine::AcceptingMachine< TransitionType_, AcceptingStyle::NonAccepting > | Specialization for non-accepting machines |
| CTuringSim::Runner::AlternatingTree< LeafType > | Represent a tree of properties with alternating quantifiers |
| CTuringSim::Machine::Amnesic::AmnesicMachine< TransitionType, deterministic, acceptingStyle, TransitionContainer, InitialStateContainer > | The class to represent an amnesic machine |
| CTuringSim::Utils::ArrayBuilder< T, N > | Build an array at compile time by applying a function |
| CTuringSim::Utils::Compare< T > | A class to compare values with a strong total order. The generic way use operator< |
| CTuringSim::Utils::Compare< std::string > | Specialization of Compare for string |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, T > | A generic debug printer, defaulting to operator<< , when no specialization applies |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, bool > | The debug printer for bool |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::array< T, N > > | The debug printer for arrays |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::deque< T, Alloc > > | The debug printer for deque |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::map< Key, Value, Comp, Alloc > > | The debug printer for maps |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::monostate > | The debug printer for monostate |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::optional< T > > | The debug printer for options |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::pair< T1, T2 > > | The debug printer for pairs |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::queue< T, C > > | The debug printer for queue |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::set< T, Comp, Alloc > > | The debug printer for sets |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::shared_ptr< T > > | The debug printer for shared pointers |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::string > | The debug printer for string |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::tuple< TT... > > | The debug printer for tuples |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::vector< T, Alloc > > | The debug printer for vectors |
| CTuringSim::Utils::Debug::Debug< CharT, Traits, std::weak_ptr< T > > | The debug printer for shared pointers |
| CTuringSim::Runner::DeterministicMachineRunner< MachineType, ListenerType, ListenerConstructorArgs > | A class to run a simulate the execution of a deterministic Machine |
| CTuringSim::Machine::Amnesic::DeterministicSimpleAmnesicMachine< StateType, acceptingStyle, AcceptingConstructorArgs > | |
| CDeterministicSimpleAmnesicMachine_impl | The class to represent a deterministic amnesic machine |
| CTuringSim::Machine::FSM::DeterministicSimpleFiniteStateMachine< StateType, SymbolType, acceptingStyle, AcceptingConstructorArgs > | The class to represent a deterministic finite state machine |
| CTuringSim::Machine::PDM::DeterministicSimplePushdownMachine< StateType, LetterType, StackSymbolType, acceptingStyle, AcceptingConstructorArgs > | The class to represent a deterministic simple pushdown machine |
| CTuringSim::Transition::Turing::TuringStyleMConfigurationTuringMachineTransition< T, hasHalfTape >::DynamicWrite | An instruction that writes a single symbol identified by a key in a substitution |
| CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< NodeStateType_, SymbolType_, hasHalfTape >::EraseInstruction | An instruction that erases the current symbol |
| ►Cexception | |
| ►CTuringSim::Utils::MessageException | The Base class for all custom exceptions |
| CTuringSim::Memory::ExistingModifierException< Memory, Modifier > | Exception thrown when attempting to bound a modifier to a memory structure that is already bound to another modifier |
| CTuringSim::Memory::InvalidFactorException | Exception thrown when a size factor is set to an illegal value |
| CTuringSim::Memory::MultiStack::EmptyMultiStackException | Exception thrown when we try to pop or top an empty stack or the whole multistack, when a stack is empty |
| CTuringSim::Memory::MultiStack::StackIndexOutOfBoundsException | Exception launched when we try to access to an non existing stack |
| CTuringSim::Memory::MultiTape::TapeIndexOutOfBoundsException | Exception threw when one try to access an non existing tape |
| CTuringSim::Memory::Stack::StackTooSmallException | Exception thrown when we try to pop or top an empty stack, or pops or tops a too small stack |
| CTuringSim::Memory::Word::WordOverflowException | The exception thrown when accessing a letter from an empty word |
| CTuringSim::State::MConfiguration::MConfigurationParserBadInitializationException | Exception thrown when the special characters of the parser are not consistent |
| CTuringSim::State::MConfiguration::MConfigurationParserSyntaxErrorException | Exception launched when we try to parse a string with a syntax error as a MConfiguration<std::string> |
| CTuringSim::State::MConfiguration::NoAlphaEquivalenceException< NodeType > | Exception launched when we try to unify two incompatibles MConfiguration |
| CTuringSim::State::MConfiguration::NoUnificationException< NodeType > | Exception launched when we try to unify two incompatibles MConfiguration |
| CTuringSim::State::MConfiguration::PureVariableException< T, V > | Exception thrown when trying to add a pure variable in a MConfigurationMap |
| CTuringSim::Symbol::TuringStyleMixedSymbolPatternParserBadInitializationException | Exception thrown when the special characters of a SymbolPatternParser are not consistent |
| CTuringSim::Symbol::TuringStyleMixedSymbolPatternSyntaxErrorException | Exception launched when we try to parse a string with a syntax error as a MConfiguration<std::string> |
| CTuringSim::Transition::ConfigurationDoesNotMatchException< TransitionType > | Exception thrown when we try to apply a transition to a configuration which does not match |
| CTuringSim::Transition::Turing::TuringStyleInstructionListParserBadInitializationException | Exception thrown when the special characters of a SymbolPatternParser are not consistent |
| CTuringSim::Transition::Turing::TuringStyleInstructionListParserSyntaxErrorException< hT > | Exception launched when we try to parse a string with a syntax error as a MConfiguration<std::string> |
| CTuringSim::Machine::FSM::FiniteStateMachine< TransitionType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a finite state machine |
| CTuringSim::Machine::PDM::GeneralPushdownMachine< StateType, LetterType, StackSymbolType, acceptingStyle, TransitionContainer_, InitialStateContainer_, AcceptingConstructorArgs > | The class to represent a pushdown machine with arbitrary transitions |
| CTuringSim::Memory::HalfTape::HalfTapeModifier< T > | Modifier for the Tape class |
| CTuringSim::Memory::HalfTape::HalfTapeObserver< T > | Observer for the Tape class |
| CTuringSim::Listener::Listener< MachineType_, IdType_ > | The base class for listeners |
| ►CTuringSim::Listener::Listener< MachineType_, std::monostate > | |
| CTuringSim::Listener::DummyListener< MachineType_ > | A listener that does nothing |
| ►CTuringSim::Listener::Listener< MachineType_, unsigned long long int > | |
| CTuringSim::Listener::DeterministicCounterListener< MachineType_ > | A listener that counts transitions of deterministic machines |
| CTuringSim::Listener::NonDeterministicCounterListener< MachineType_ > | A listener that counts transitions of non-deterministic machines |
| CTuringSim::Machine::Turing::LocalTuringMachine< TransitionType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | Turing machines that only reads the current cell on the tape to select matching transitions |
| ►CTuringSim::Machine::Turing::LocalTuringMachine< Transition::Turing::SimpleTuringMachineTransition< StateType_, SymbolType_, false >, false, AcceptingStyle::NonAccepting, std::set, std::set > | |
| CTuringSim::Machine::Turing::SimpleTuringMachine< StateType_, SymbolType_, deterministic, hasHalfTape, acceptingStyle > | The class to represent a simple turing machine |
| ►CTuringSim::Machine::Turing::LocalTuringMachine< Transition::Turing::SimpleTuringMachineTransition< StateType_, SymbolType_, hasHalfTape >, deterministic, acceptingStyle, std::set, std::set > | |
| ►CTuringSim::Machine::Turing::SimpleTuringMachine< StateType_, SymbolType_, false, false, AcceptingStyle::NonAccepting > | |
| CTuringSim::Machine::Turing::NonDeterministicSimpleTuringMachine< StateType_, SymbolType_, hasHalfTape, acceptingStyle > | The class to represent a simple turing machine |
| ►CTuringSim::Machine::Turing::SimpleTuringMachine< StateType_, SymbolType_, true, false, AcceptingStyle::NonAccepting > | |
| CTuringSim::Machine::Turing::DeterministicSimpleTuringMachine< StateType_, SymbolType_, hasHalfTape, acceptingStyle > | The class to represent a deterministic simple turing machine |
| ►CTuringSim::Machine::Turing::LocalTuringMachine< Transition::Turing::TuringStyleMConfigurationTuringMachineTransition< SymbolType_, false >, false, AcceptingStyle::NonAccepting, std::set, std::set > | |
| CTuringSim::Machine::Turing::TuringStyleMConfigurationTuringMachine< SymbolType_, deterministic, hasHalfTape, acceptingStyle > | Machines whose transitions are Transition::TuringStyleMConfigurationTuringMachineTransition |
| ►CTuringSim::Machine::Turing::LocalTuringMachine< Transition::Turing::TuringStyleMConfigurationTuringMachineTransition< SymbolType_, hasHalfTape >, deterministic, acceptingStyle, std::set, std::set > | |
| ►CTuringSim::Machine::Turing::TuringStyleMConfigurationTuringMachine< SymbolType_, false, false, AcceptingStyle::NonAccepting > | |
| CTuringSim::Machine::Turing::NonDeterministicTuringStyleMConfigurationTuringMachine< SymbolType_, hasHalfTape, acceptingStyle > | Non-deterministic machines whose transitions are Transition::TuringStyleMConfigurationTuringMachineTransition |
| ►CTuringSim::Machine::Turing::TuringStyleMConfigurationTuringMachine< SymbolType_, true, false, AcceptingStyle::NonAccepting > | |
| CTuringSim::Machine::Turing::DeterministicTuringStyleMConfigurationTuringMachine< SymbolType_, hasHalfTape, acceptingStyle > | Deterministic machines whose transitions are Transition::TuringStyleMConfigurationTuringMachineTransition |
| CTuringSim::Machine::Machine< TransitionType, deterministic, acceptingStyle, TransitionContainer, InitialStateContainer > | Base class for machines |
| ►CTuringSim::Machine::Machine< TransitionType_, deterministic, acceptingStyle, std::vector, std::vector > | |
| CTuringSim::Machine::Turing::TuringMachine< TransitionType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a Turing machine |
| ►CTuringSim::Machine::Machine< TransitionType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | |
| ►CTuringSim::Machine::Turing::TuringMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | |
| CTuringSim::Machine::Turing::LocalTuringMachine< TransitionType_, false, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | Non-deterministic Turing machines that only reads the current cell on the tape to select matching transitions |
| ►CTuringSim::Machine::Turing::TuringMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | |
| CTuringSim::Machine::Turing::LocalTuringMachine< TransitionType_, true, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | Deterministic Turing machines that only reads the current cell on the tape to select matching transitions |
| CTuringSim::Runner::MachineRunner_accepting_impl< MachineType, Enable > | Internal class to add a "void accept()" member for accepting machines |
| ►CTuringSim::Runner::MachineRunner_accepting_impl< MachineType_ > | |
| ►CTuringSim::Runner::MachineRunner< MachineType_, ListenerType_ > | A class to run a simulate the execution of a Machine |
| CTuringSim::Runner::DeterministicMachineRunner< MachineType_, ListenerType_, std::tuple< Args... > > | A class to run a simulate the execution of a deterministic Machine |
| CTuringSim::Runner::MaybeEpsilonFiniteStateMachineRunner< MachineType_, ListenerType_, std::tuple< ListenerConstructorArgs... > > | A class to run a simulate the execution of a MaybeEpsilonFiniteStateMachine |
| CTuringSim::Runner::NonDeterministicMachineRunner< MachineType_, ListenerType_, std::tuple< ListenerConstructorArgs... > > | A class to run a simulate the execution of a non-deterministic Machine |
| CTuringSim::Runner::NonDeterministicSimpleFiniteStateMachineRunner< MachineType_, ListenerType_, std::tuple< ListenerConstructorArgs... > > | A class to run a simulate the execution of a NonDeterministicSimpleFiniteStateMachine |
| CTuringSim::Runner::MachineRunner< MachineType_, void > | The specialization of TuringSim::Runner::MachineRunner that does not use a listener |
| CTuringSim::Runner::MachineRunner_accepting_impl< MachineType_, std::enable_if_t< MachineType_::IsAccepting::value > > | Specialization for accepting machines |
| CTuringSim::Runner::MachineRunner_accepting_impl< MachineType_, std::enable_if_t<!MachineType_::IsAccepting::value > > | Specialization for non-accepting machines |
| CTuringSim::Runner::MachineRunnerArgs< MachineType, ListenerType > | Provides types to use in constructors for generic versions |
| CTuringSim::Runner::MachineRunnerArgs< MachineType, void > | Provides types to use in constructors for generic versions |
| ►CMachineType_ | |
| CTuringSim::Machine::StateAcceptingMachine< MachineType_, AcceptingStyle::Accepting > | Implementation of acceptation-related functions for accepting machine |
| CTuringSim::Machine::StateAcceptingMachine< MachineType_, AcceptingStyle::Alternating > | Implementation of acceptation-related functions for alternating machine |
| CTuringSim::Machine::StateAcceptingMachine< MachineType_, AcceptingStyle::NonAccepting > | Implementation of acceptation-related functions for non-accepting machine |
| CTuringSim::Machine::FSM::MaybeEpsilonFiniteStateMachine< StateType, SymbolType, acceptingStyle, AcceptingConstructorArgs > | The class to represent a finite state machine with epsilon-transitions |
| CTuringSim::Runner::MaybeEpsilonFiniteStateMachineRunner< MachineType, ListenerType, ListenerConstructorArgs > | A class to run a simulate the execution of a MaybeEpsilonFiniteStateMachine |
| CTuringSim::State::MConfiguration::MConfigurationMap< NodeType, V > | An optimized map where keys are m-configurations |
| CTuringSim::State::MConfiguration::MConfigurationMap< SymbolType, TransitionType > | |
| CTuringSim::State::MConfiguration::MConfigurationMap< T, V > | |
| CTuringSim::State::MConfiguration::MConfigurationParser | Parse a m-configuration written as a std::string into a MConfiguration<std::string> |
| CTuringSim::Memory::MemoryModifier< Memory, Modifier > | Base class for all memory modifiers |
| CTuringSim::Memory::MemoryObserver< Memory, Observer > | Base class for all memory observers |
| CTuringSim::Memory::MemoryStructure< T, D, O, M > | Base class for all memory structures |
| ►CTuringSim::Memory::MemoryStructure< std::array< T, N >, MultiStack< T, N >, MultiStackObserver< T, N >, MultiStackModifier< T, N > > | |
| CTuringSim::Memory::MultiStack::MultiStack< T, N > | A memory structure made of a given number of homogeneous stacks |
| ►CTuringSim::Memory::MemoryStructure< std::array< T, N >, MultiTape< T, N >, MultiTapeObserver< T, N >, MultiTapeModifier< T, N > > | |
| CTuringSim::Memory::MultiTape::MultiTape< T, N > | A memory structure made of given number of tapes |
| ►CTuringSim::Memory::MemoryStructure< SymbolType, Word< SymbolType >, WordObserver< SymbolType >, WordModifier< SymbolType > > | |
| CTuringSim::Memory::Word::Word< SymbolType > | |
| ►CTuringSim::Memory::MemoryStructure< T, HalfTape< T >, HalfTapeObserver< T >, HalfTapeModifier< T > > | |
| CTuringSim::Memory::HalfTape::HalfTape< T > | Class to represent a half-tape memory |
| ►CTuringSim::Memory::MemoryStructure< T, RandomAccessMemory< T >, RandomAccessMemoryObserver< T >, RandomAccessMemoryModifier< T > > | |
| CTuringSim::Memory::RandomAccessMemory::RandomAccessMemory< T > | Class to represent a random access memory (RAM) |
| ►CTuringSim::Memory::MemoryStructure< T, Stack< T >, StackObserver< T >, StackModifier< T > > | |
| CTuringSim::Memory::Stack::Stack< T > | Class to represent a stack memory |
| ►CTuringSim::Memory::MemoryStructure< T, Tape< T >, TapeObserver< T >, TapeModifier< T > > | |
| CTuringSim::Memory::Tape::Tape< T > | Class to represent a tape memory |
| ►CTuringSim::Memory::MemoryStructure< T, Word< T >, WordObserver< T >, WordModifier< T > > | |
| CTuringSim::Memory::Word::Word< T > | Class to represent a word memory, as used by a FSA |
| CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< NodeStateType_, SymbolType_, hasHalfTape >::MovementInstruction | An instruction that performs a move on the tape |
| CTuringSim::Memory::MultiStack::MultiStackModifier< T, N > | Modifier for the MultiStack class |
| CTuringSim::Memory::MultiStack::MultiStackObserver< T, N > | Observer for the MultiStack class |
| CTuringSim::Memory::MultiTape::MultiTapeModifier< T, N > | Modifier for the MultiTape class |
| CTuringSim::Memory::MultiTape::MultiTapeObserver< T, N > | Observer for the MultiTape class |
| CTuringSim::Runner::NonDeterministicMachineRunner< MachineType, ListenerType, ListenerConstructorArgs > | A class to run a simulate the execution of a non-deterministic Machine |
| CTuringSim::Machine::Amnesic::NonDeterministicSimpleAmnesicMachine< StateType, acceptingStyle, AcceptingConstructorArgs > | |
| CNonDeterministicSimpleAmnesicMachine_impl | The class to represent a deterministic amnesic machine |
| CTuringSim::Machine::FSM::NonDeterministicSimpleFiniteStateMachine< StateType, SymbolType, acceptingStyle, AcceptingConstructorArgs > | The class to represent a non-deterministic finite state machine without epsilon-transitions |
| CTuringSim::Runner::NonDeterministicSimpleFiniteStateMachineRunner< MachineType, ListenerType, ListenerConstructorArgs > | A class to run a simulate the execution of a NonDeterministicSimpleFiniteStateMachine |
| CTuringSim::Machine::PDM::NonDeterministicSimplePushdownMachine< StateType, LetterType, StackSymbolType, acceptingStyle, AcceptingConstructorArgs > | The class to represent a non-deterministic simple pushdown machine |
| CTuringSim::Machine::PDM::PushdownMachine< TransitionType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | The class to represent a pushdown machine |
| ►CTuringSim::Machine::PDM::PushdownMachine< Transition::PDM::SimplePushdownMachineTransition< StateType_, LetterType_, StackSymbolType_ >, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_ > | |
| CTuringSim::Machine::PDM::SimplePushdownMachine< StateType_, LetterType_, StackSymbolType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_, std::tuple< Args... > > | The class to represent a pushdown machine with simple transitions |
| CTuringSim::Memory::RandomAccessMemory::RandomAccessMemoryModifier< T > | Modifier for the RAM class |
| CTuringSim::Memory::RandomAccessMemory::RandomAccessMemoryObserver< T > | Observer for the RAM class |
| CTuringSim::Machine::Amnesic::SimpleAmnesicMachine< StateType, deterministic, acceptingStyle, TransitionContainer, InitialStateContainer, AcceptingConstructorArgs > | The base class of amnesic machine with simple state and explicit list of transitions |
| ►CTuringSim::Machine::Amnesic::SimpleAmnesicMachine< StateType_, false, acceptingStyle > | |
| CTuringSim::Machine::Amnesic::NonDeterministicSimpleAmnesicMachine< StateType_, acceptingStyle, std::tuple< Args... > > | The only specialization, using default parameters, to access the parameter pack |
| ►CTuringSim::Machine::Amnesic::SimpleAmnesicMachine< StateType_, true, acceptingStyle > | |
| CTuringSim::Machine::Amnesic::DeterministicSimpleAmnesicMachine< StateType_, acceptingStyle, std::tuple< Args... > > | The only specialization, using default parameters, to access the parameter pack |
| CTuringSim::Machine::FSM::SimpleFiniteStateMachine< StateType, SymbolType, deterministic, acceptingStyle, TransitionContainer, InitialStateContainer, AcceptingConstructorArgs > | The class to represent a finite state machine |
| ►CTuringSim::Machine::FSM::SimpleFiniteStateMachine< StateType_, SymbolType_, false, acceptingStyle, std::set, std::set > | |
| CTuringSim::Machine::FSM::NonDeterministicSimpleFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > > | The class to represent a non-deterministic finite state machine |
| ►CTuringSim::Machine::FSM::SimpleFiniteStateMachine< StateType_, SymbolType_, true, acceptingStyle, std::set, std::set > | |
| CTuringSim::Machine::FSM::DeterministicSimpleFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > > | The class to represent a deterministic finite state machine |
| CSimpleFiniteStateMachine_accept_impl | Implementation of acceptation-related functions |
| CTuringSim::Machine::PDM::SimplePushdownMachine< StateType, LetterType, StackSymbolType, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_, AcceptingConstructorArgs > | The class to represent a pushdown machine with simple transitions |
| ►CTuringSim::Machine::PDM::SimplePushdownMachine< StateType_, LetterType_, StackSymbolType_, false, acceptingStyle, std::set, std::set > | |
| CTuringSim::Machine::PDM::NonDeterministicSimplePushdownMachine< StateType_, LetterType_, StackSymbolType_, acceptingStyle, std::tuple< Args... > > | The class to represent a non-deterministic simple pushdown machine |
| ►CTuringSim::Machine::PDM::SimplePushdownMachine< StateType_, LetterType_, StackSymbolType_, true, acceptingStyle, std::set, std::set > | |
| CTuringSim::Machine::PDM::DeterministicSimplePushdownMachine< StateType_, LetterType_, StackSymbolType_, acceptingStyle, std::tuple< Args... > > | The class to represent a deterministic simple pushdown machine |
| CTuringSim::Memory::Stack::StackModifier< T > | Modifier for the Stack class |
| CTuringSim::Memory::Stack::StackObserver< T > | Observer for the Stack class |
| ►CTuringSim::Machine::StateAcceptingMachine< MachineType, acceptingStyle > | |
| CTuringSim::Machine::Amnesic::SimpleAmnesicMachine< StateType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_, std::tuple< Args... > > | The base class of amnesic machine with simple state and explicit list of transitions |
| CTuringSim::Machine::FSM::MaybeEpsilonFiniteStateMachine< StateType_, SymbolType_, acceptingStyle, std::tuple< Args... > > | The class to represent a finite state machine with epsilon-transitions |
| CTuringSim::Machine::FSM::SimpleFiniteStateMachine< StateType_, SymbolType_, deterministic, acceptingStyle, TransitionContainer_, InitialStateContainer_, std::tuple< Args... > > | The class to represent a finite state machine |
| CTuringSim::Machine::PDM::GeneralPushdownMachine< StateType_, LetterType_, StackSymbolType_, acceptingStyle, TransitionContainer_, InitialStateContainer_, std::tuple< Args... > > | The class to represent a pushdown machine with arbitrary transitions |
| CTuringSim::Machine::impl_details_::StateAcceptingMachineArgs< StateType, acceptingStyle > | This class provide a single type AcceptingConstructorArgs that is the tuple of parameters used to decide the acceptance |
| CTuringSim::Machine::impl_details_::StateAcceptingMachineArgs< StateType_, AcceptingStyle::Accepting > | The specialization of SimpleFiniteStateMachineArgs for accepting states |
| CTuringSim::Machine::impl_details_::StateAcceptingMachineArgs< StateType_, AcceptingStyle::Alternating > | The specialization of SimpleFiniteStateMachineArgs for alternating states |
| CTuringSim::Machine::impl_details_::StateAcceptingMachineArgs< StateType_, AcceptingStyle::NonAccepting > | The specialization of SimpleFiniteStateMachineArgs for non accepting states |
| CTuringSim::State::StatePattern< StateType_, MatcherType_ > | The base class of all state patterns |
| ►CTuringSim::State::StatePattern< StateType, std::monostate > | |
| CTuringSim::State::SimpleStatePattern< StateType > | |
| ►CTuringSim::State::StatePattern< std::shared_ptr< const MConfiguration< NodeType > >, std::map< NodeType, std::shared_ptr< const MConfiguration< NodeType > > > > | |
| CTuringSim::State::MConfiguration::MConfiguration< NodeType > | The base class for m-configurations |
| ►CTuringSim::State::StatePattern< std::shared_ptr< const MConfiguration< T > >, std::map< T, std::shared_ptr< const MConfiguration< T > > > > | |
| CTuringSim::State::MConfiguration::MConfiguration< T > | |
| ►CTuringSim::State::StatePattern< T, std::monostate > | |
| CTuringSim::State::SimpleStatePattern< T > | A simple explicit state pattern |
| CTuringSim::Symbol::SymbolPattern< SymbolType_, Context_ > | Base class to store any symbol pattern on one letter |
| ►CTuringSim::Symbol::SymbolPattern< std::string, std::map< std::string, std::shared_ptr< const State::MConfiguration::MConfiguration< std::string > > > > | |
| ►CTuringSim::Symbol::MixedSymbolPattern< std::string, std::shared_ptr< const State::MConfiguration::MConfiguration< std::string > >, std::string > | |
| CTuringSim::Symbol::TuringStyleMixedSymbolPattern< std::string > | |
| ►CTuringSim::Symbol::SymbolPattern< SymbolType, std::map< KeyType, ValueType > > | |
| CTuringSim::Symbol::DynamicSymbolPattern< KeyType, ValueType, SymbolType > | A dynamic symbol pattern where accepted/rejected letters are identified by keys, and interpreted in a context |
| CTuringSim::Symbol::MixedSymbolPattern< KeyType, ValueType, SymbolType > | A dynamic symbol pattern where some accepted/rejected symbols are explicit and constant, and other accepted/rejected letters are identified by keys, and interpreted in a context |
| ►CTuringSim::Symbol::SymbolPattern< SymbolType, std::map< SymbolType, State::MConfiguration::MConfiguration< SymbolType > > > | |
| ►CTuringSim::Symbol::DynamicSymbolPattern< SymbolType, State::MConfiguration::MConfiguration< SymbolType >, SymbolType > | |
| CTuringSim::Symbol::TuringStyleDynamicSymbolPattern< SymbolType > | A DynamicSymbolPattern with a predicate adapted to m-configuration |
| ►CTuringSim::Symbol::SymbolPattern< SymbolType, std::map< SymbolType, std::shared_ptr< const State::MConfiguration::MConfiguration< SymbolType > > > > | |
| ►CTuringSim::Symbol::MixedSymbolPattern< SymbolType, std::shared_ptr< const State::MConfiguration::MConfiguration< SymbolType > >, SymbolType > | |
| CTuringSim::Symbol::TuringStyleMixedSymbolPattern< SymbolType > | A MixedSymbolPattern with a predicate adapted to m-configuration |
| ►CTuringSim::Symbol::SymbolPattern< SymbolType, void > | |
| CTuringSim::Symbol::SimpleSymbolPattern< SymbolType > | |
| CTuringSim::Symbol::SymbolPattern< SymbolType_, void > | Base class to store any symbol pattern on one letter, without context, for static patterns |
| ►CTuringSim::Symbol::SymbolPattern< T, std::map< T, std::shared_ptr< const State::MConfiguration::MConfiguration< T > > > > | |
| ►CTuringSim::Symbol::MixedSymbolPattern< T, std::shared_ptr< const State::MConfiguration::MConfiguration< T > >, T > | |
| CTuringSim::Symbol::TuringStyleMixedSymbolPattern< T > | |
| ►CTuringSim::Symbol::SymbolPattern< T, void > | |
| CTuringSim::Symbol::SimpleSymbolPattern< T > | Class to encode symbol pattern made of only one symbol |
| CTuringSim::Symbol::TuringStyleConstantSymbolPattern< T > | A symbol pattern as used by Turing. Such a pattern accept or reject a finite explicit set of symbols |
| CTuringSim::Utils::TaggedUidDispenserFactory< Tag, UID > | Return a new UID dispenser at each invocation |
| CTuringSim::Memory::Tape::TapeModifier< T > | Modifier for the Tape class |
| CTuringSim::Memory::Tape::TapeObserver< T > | Observer for the Tape class |
| CTuringSim::Transition::Transition< StateType_, StorageType_, ApplyHelperType_ > | Base class for transitions |
| ►CTuringSim::Transition::Transition< StateType_, Memory::TapeLike< false, SymbolType_ >, ApplyHelperType_ > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< StateType_, SymbolType_, ApplyHelperType_, hasHalfTape > | Base class for Turing machine transitions |
| ►CTuringSim::Transition::Turing::LocalTuringMachineTransition< StateType_, SymbolType_, ApplyHelperType_, false > | |
| CTuringSim::Transition::Turing::OneStepTuringMachineTransition< StateType_, SymbolType_, ApplyHelperType_, hasHalfTape > | Turing machine transitions that reads only the current symbol, writes a symbol, performs a simple move and gets into a new state |
| ►CTuringSim::Transition::Transition< StateType_, Memory::TapeLike< hasHalfTape, SymbolType_ >, ApplyHelperType_ > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< StateType_, SymbolType_, ApplyHelperType_, false > | |
| CTuringSim::Transition::Turing::LocalTuringMachineTransition< StateType_, SymbolType_, ApplyHelperType_, hasHalfTape > | Base class for Turing machine transitions that only reads the current symbol on the tape to decide if it matches |
| ►CTuringSim::Transition::Transition< StateType_, Memory::TapeLike< hasHalfTape, SymbolType_ >, std::monostate > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< StateType_, SymbolType_, std::monostate, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::LocalTuringMachineTransition< StateType_, SymbolType_, std::monostate, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::OneStepTuringMachineTransition< StateType_, SymbolType_, std::monostate, false > | |
| CTuringSim::Transition::Turing::SimpleTuringMachineTransition< StateType_, SymbolType_, hasHalfTape > | Turing machine transition where the state pattern is a TuringSim::State::SimpleStatePattern and the symbol pattern is a Symbol::SimpleSymbolPattern |
| ►CTuringSim::Transition::Transition< StateType_, Memory::Word::Word< SymbolType_ >, std::monostate > | |
| ►CTuringSim::Transition::FSM::FiniteStateMachineTransition< StateType_, SymbolType_ > | Transition of finite state machines, i.e. transition on a word |
| CTuringSim::Transition::FSM::MaybeEpsilonFiniteStateMachineTransition< StateType_, SymbolType_ > | Transition of finite state machines, i.e. transition on a word, without epsilon-transitions |
| CTuringSim::Transition::FSM::SimpleFiniteStateMachineTransition< StateType_, SymbolType_ > | Transition of finite state machines, i.e. transition on a word, without epsilon-transitions |
| ►CTuringSim::Transition::Transition< StateType_, PushdownMachineStorage< LetterType_, StackSymbolType_ >, std::monostate > | |
| ►CTuringSim::Transition::PDM::PushdownMachineTransition< StateType_, LetterType_, StackSymbolType_ > | Transition of pushdown machines, i.e. transition on a word and a stack |
| CTuringSim::Transition::PDM::GeneralPushdownMachineTransition< StateType_, LetterType_, StackSymbolType_ > | Transition of pushdown machines, i.e. transition on a word and a stack |
| CTuringSim::Transition::PDM::SimplePushdownMachineTransition< StateType_, LetterType_, StackSymbolType_ > | Transition of pushdown machines, i.e. transition on a word and a stack |
| ►CTuringSim::Transition::Transition< StateType_, std::monostate, std::monostate > | |
| ►CTuringSim::Transition::Amnesic::AmnesicMachineTransition< StateType_ > | The transition base class for AmnesicMachine |
| CTuringSim::Transition::Amnesic::SimpleAmnesicMachineTransition< StateType_ > | A simple transition of an amnesic machine: from an explicit state to an explicit state |
| ►CTuringSim::Transition::Transition< std::shared_ptr< const State::MConfiguration::MConfiguration< NodeStateType_ > >, Memory::TapeLike< hasHalfTape, SymbolType_ >, MConfigurationTuringMachineTransitionApplyHelper< NodeStateType_ > > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< NodeStateType_ > >, SymbolType_, MConfigurationTuringMachineTransitionApplyHelper< NodeStateType_ >, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::LocalTuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< NodeStateType_ > >, SymbolType_, MConfigurationTuringMachineTransitionApplyHelper< NodeStateType_ >, hasHalfTape > | |
| CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< NodeStateType_, SymbolType_, hasHalfTape > | Base class for Turing machine transitions that works with m-configurations |
| ►CTuringSim::Transition::Transition< std::shared_ptr< const State::MConfiguration::MConfiguration< std::string > >, Memory::TapeLike< hasHalfTape, std::string >, MConfigurationTuringMachineTransitionApplyHelper< std::string > > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< std::string > >, std::string, MConfigurationTuringMachineTransitionApplyHelper< std::string >, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::LocalTuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< std::string > >, std::string, MConfigurationTuringMachineTransitionApplyHelper< std::string >, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< std::string, std::string, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::TuringStyleMConfigurationTuringMachineTransition< std::string, false > | |
| CTuringSim::Transition::Turing::StringTuringStyleMConfigurationTuringMachineTransition< isHalfTape > | Transitions as we find in 1936 Turing's paper, where nodes are std::string |
| ►CTuringSim::Transition::Transition< std::shared_ptr< const State::MConfiguration::MConfiguration< T > >, Memory::TapeLike< hasHalfTape, T >, MConfigurationTuringMachineTransitionApplyHelper< T > > | |
| ►CTuringSim::Transition::Turing::TuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< T > >, T, MConfigurationTuringMachineTransitionApplyHelper< T >, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::LocalTuringMachineTransition< std::shared_ptr< const State::MConfiguration::MConfiguration< T > >, T, MConfigurationTuringMachineTransitionApplyHelper< T >, hasHalfTape > | |
| ►CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< T, T, hasHalfTape > | |
| CTuringSim::Transition::Turing::TuringStyleMConfigurationTuringMachineTransition< T, hasHalfTape > | Transitions as we find in 1936 Turing's paper |
| CTuringSim::Transition::Turing::TuringStyleInstructionListParser< hasHalfTape > | A parser for instructions of StringTuringStyleMConfigurationTuringMachineTransition |
| CTuringSim::Symbol::TuringStyleMixedSymbolPatternParser | A parser of mixed symbol pattern where symbols are std::string |
| CTuringSim::Utils::UidDispenser< UID > | A dispenser of unique identifier |
| CTuringSim::Utils::UidDispenser< std::pair< Tag, UID > > | A specialization that returns pairs made of a tag, and an integer UID |
| CTuringSim::Utils::UidDispenser< unsigned long long int > | |
| CTuringSim::Machine::Turing::Utm | A factory for the universal Turing machine described in Turing's 1936 paper |
| CTuringSim::Memory::Word::WordModifier< T > | Modifier for the Word class |
| CTuringSim::Memory::Word::WordObserver< T > | Observer for the Word class |
| CTuringSim::Transition::Turing::MConfigurationTuringMachineTransition< NodeStateType_, SymbolType_, hasHalfTape >::WriteInstruction | An instruction that writes a symbol on the tape. |
| ►CTs | |
| CTuringSim::Utils::Visitor< Ts > | Allows to easily build visitor for variant type from several callable objects, in particular lambda |
