TuringSim
C++ framework to simulate abstract computing models
stateAcceptingAmnesicMachine.h
1 #include <machine/stateAcceptingMachine.h>
2 #include <machine/amnesic/amnesicMachine.h>
3 
13  template<
14  typename TransitionType,
15  bool deterministic,
16  AcceptingStyle acceptingStyle,
17  template<typename...> class TransitionContainer = std::vector,
18  template<typename...> class InitialStateContainer = std::set
19  >
22  TransitionType,
23  deterministic,
24  acceptingStyle,
25  TransitionContainer,
26  InitialStateContainer>,
27  acceptingStyle>;
28 }
TuringSim::Machine::AcceptingStyle
AcceptingStyle
Whether the machine is accepting, alternating or nothing.
Definition: acceptingMachine.h:11
TuringSim::Machine::Amnesic
Namespace of amnesic machine, that is machines without memory.
TuringSim::Machine::StateAcceptingMachine
Definition: stateAcceptingMachine.h:93
TuringSim::Machine::Amnesic::AmnesicMachine
The class to represent an amnesic machine.
Definition: amnesicMachine.h:32