46 template <
class Automaton >
47 requires isDFA < Automaton > || isNFA < Automaton >
51template <
class Automaton >
52requires isDFA < Automaton > || isNFA < Automaton >
61 if (
automaton.getFinalStates().contains(t.second)) {
66 for(
const auto& qf :
res.getFinalStates())
67 for(
const auto& t :
res.getTransitionsToState(qf))
68 res.addTransition(t.first.first, t.first.second,
res.getInitialState());
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
typename T::StateType StateType
Definition: ToGrammarLeftRG.h:64
Definition: ToGrammar.h:31
T createUnique(T object, const Alphabets &... alphabets)
Definition: createUnique.hpp:46
ContainerType< ResType > transform(const ContainerType< InType, Ts ... > &in, Callback transform)
In container tranformation of all elements according to the tranform.
Definition: algorithm.hpp:150