48 template <
class SymbolType,
class StateType >
55 template <
class SymbolType,
class StateType >
62 template <
class SymbolType,
class StateType >
73 template <
class SymbolType,
class StateType >
78template <
class SymbolType,
class StateType >
80 unsigned firstDefault = 1;
81 unsigned secondDefault = 2;
86 res.addInputSymbol(a);
87 for(
const auto& a :
second.getInputAlphabet())
88 res.addInputSymbol(a);
92 for (
const auto &
q :
second.getStates ( ) )
97 for(
const auto&
q :
second.getFinalStates())
106 for(
const auto& t :
second.getTransitions())
112template <
class SymbolType,
class StateType >
114 unsigned firstDefault = 1;
115 unsigned secondDefault = 2;
120 res.addInputSymbol(a);
121 for(
const auto& a :
second.getInputAlphabet())
122 res.addInputSymbol(a);
126 for (
const auto &
q :
second.getStates ( ) )
131 for(
const auto&
q :
second.getFinalStates())
140 for(
const auto& t :
second.getTransitions())
146template <
class SymbolType,
class StateType >
148 unsigned firstDefault = 1;
149 unsigned secondDefault = 2;
154 res.addInputSymbol(a);
155 for(
const auto& a :
second.getInputAlphabet())
156 res.addInputSymbol(a);
160 for (
const auto &
q :
second.getStates ( ) )
165 for(
const auto&
q :
second.getFinalStates())
174 for(
const auto& t :
second.getTransitions())
180template <
class SymbolType,
class StateType >
182 unsigned firstDefault = 1;
183 unsigned secondDefault = 2;
188 res.addInputSymbol(a);
189 for(
const auto& a :
second.getInputAlphabet())
190 res.addInputSymbol(a);
194 for (
const auto &
q :
second.getStates ( ) )
199 for(
const auto&
q :
second.getFinalStates())
204 for (
const auto & state : t.first.second ) {
207 res.addTransition ( t.first.first, std::move ( source ),
ext::make_pair ( t.second, firstDefault ) );
210 for(
const auto& t :
second.getTransitions()) {
212 for (
const auto & state : t.first.second ) {
215 res.addTransition ( t.first.first, std::move ( source ),
ext::make_pair ( t.second, secondDefault ) );
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
const ext::set< StateType > & getFinalStates() const &
Definition: DFA.h:183
const ext::map< ext::pair< StateType, SymbolType >, StateType > & getTransitions() const &
Definition: DFA.h:473
const StateType & getInitialState() const &
Definition: DFA.h:105
const ext::set< SymbolType > & getInputAlphabet() const &
Definition: DFA.h:232
const ext::set< StateType > & getStates() const &
Definition: DFA.h:134
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: EpsilonNFA.h:74
const ext::set< StateType > & getStates() const &
Definition: EpsilonNFA.h:158
const ext::set< StateType > & getFinalStates() const &
Definition: EpsilonNFA.h:207
const ext::set< SymbolType > & getInputAlphabet() const &
Definition: EpsilonNFA.h:256
const ext::multimap< ext::pair< StateType, common::symbol_or_epsilon< SymbolType > >, StateType > & getTransitions() const &
Definition: EpsilonNFA.h:666
const StateType & getInitialState() const &
Definition: EpsilonNFA.h:129
Epsilon nondeterministic finite automaton. Accepts regular languages.
Definition: MultiInitialStateEpsilonNFA.h:75
Nondeterministic finite automaton with multiple initial states. Accepts regular languages.
Definition: MultiInitialStateNFA.h:69
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
const ext::set< StateType > & getStates() const &
Definition: NFA.h:136
const StateType & getInitialState() const &
Definition: NFA.h:107
const ext::set< SymbolType > & getInputAlphabet() const &
Definition: NFA.h:234
const ext::multimap< ext::pair< StateType, SymbolType >, StateType > & getTransitions() const &
Definition: NFA.h:484
const ext::set< StateType > & getFinalStates() const &
Definition: NFA.h:185
Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages.
Definition: NFTA.h:72
const ext::set< StateType > & getFinalStates() const &
Definition: NFTA.h:159
const ext::multimap< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< StateType > >, StateType > & getTransitions() const &
Definition: NFTA.h:294
const ext::set< StateType > & getStates() const &
Definition: NFTA.h:110
const ext::set< common::ranked_symbol< SymbolType > > & getInputAlphabet() const &
Definition: NFTA.h:208
Class extending the vector class from the standard library. Original reason is to allow printing of t...
Definition: vector.hpp:45
q
Definition: SingleInitialStateEpsilonTransition.h:85
Definition: ToGrammar.h:31
ContainerType< ResType > transform(const ContainerType< InType, Ts ... > &in, Callback transform)
In container tranformation of all elements according to the tranform.
Definition: algorithm.hpp:150
constexpr auto make_pair(T1 &&x, T2 &&y)
Definition: pair.hpp:79