35 template <
class SymbolType >
47 template <
class SymbolType >
52template <
class SymbolType >
57template <
class SymbolType >
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::UnboundedRegExp< SymbolType > ®exp)
Definition: ToAutomatonGlushkov.h:58
Definition: ToAutomaton.h:24
static automaton::NFA< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > ®exp)
Definition: ToAutomaton.h:53
Definition: converterCommon.hpp:8
Definition: ToAutomaton.h:15