TuringSim
C++ framework to simulate abstract computing models
stateAcceptingFiniteStateMachine.h
1 #pragma once
2 
3 #include <machine/stateAcceptingMachine.h>
4 #include <machine/FSM/finiteStateMachine.h>
5 
6 namespace TuringSim::Machine::FSM {
15  template<
16  typename TransitionType,
17  bool deterministic,
18  AcceptingStyle acceptingStyle,
19  template<typename...> class TransitionContainer = std::vector,
20  template<typename...> class InitialStateContainer = std::set
21  >
25  TransitionType,
26  deterministic,
27  acceptingStyle,
28  TransitionContainer,
29  InitialStateContainer
30  >,
31  acceptingStyle>;
32 }
TuringSim::Machine::AcceptingStyle
AcceptingStyle
Whether the machine is accepting, alternating or nothing.
Definition: acceptingMachine.h:11
TuringSim::Machine::FSM
Namespace of finite-state machines, that is whose storage is a word.
Definition: deterministicSimpleFiniteStateMachine.h:6
TuringSim::Machine::StateAcceptingMachine
Definition: stateAcceptingMachine.h:93
TuringSim::Machine::FSM::FiniteStateMachine
The class to represent a finite state machine.
Definition: finiteStateMachine.h:32