8#include <string/LinearString.h>
43 template <
class SymbolType,
class StateType >
58 template <
class SymbolType,
class StateType >
61 template <
class SymbolType,
class StateType >
76 template <
class SymbolType,
class StateType >
91 template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
106 template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
121 template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
136 template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
141template <
class SymbolType,
class StateType >
145 return std::get < 2 > (
res );
148template <
class SymbolType,
class StateType >
152 return std::get < 2 > (
res );
155template <
class SymbolType,
class StateType >
159 return std::get < 2 > (
res );
162template <
class SymbolType,
class StateType >
166 return std::get < 2 > (
res );
169template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
173 return std::get < 2 > (
res );
176template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
180 return std::get < 2 > (
res );
183template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
187 return std::get < 2 > (
res );
190template <
class InputSymbolType,
class PushdownStoreSymbolType,
class StateType >
194 return std::get < 2 > (
res );
Deterministic Z-Automaton in Arc-Factored Normal Form. Computation model for unranked regular tree la...
Definition: ArcFactoredDeterministicZAutomaton.h:65
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages.
Definition: DFTA.h:74
Deterministic pushdown automaton. Accepts subset of context free languages.
Definition: DPDA.h:78
Deterministic real time height deterministic pushdown automaton. Accepts subset of context free langu...
Definition: RealTimeHeightDeterministicDPDA.h:89
Deterministic unordered finite tree automaton without epsilon transitions. Accepts regular tree langu...
Definition: UnorderedDFTA.h:72
Deterministic visibly pushdown automaton. Accepts subset of context free languages.
Definition: VisiblyPushdownDPDA.h:86
Implementation of automaton run over its input reporting occurrences .
Definition: Occurrences.h:30
static ext::set< unsigned > occurrences(const automaton::DFA< SymbolType, StateType > &automaton, const string::LinearString< SymbolType > &string)
Definition: Occurrences.h:142
Class extending the deque class from the standard library. Original reason is to allow printing of th...
Definition: deque.hpp:44
Class extending the tuple class from the standard library. Original reason is to allow printing of th...
Definition: tuple.hpp:42
Linear string.
Definition: LinearString.h:57
Tree structure represented in its natural representation. The representation is so called ranked,...
Definition: RankedTree.h:72
Tree structure represented in its natural representation. The representation is so called ranked,...
Definition: UnorderedRankedTree.h:70
Tree represented in its natural representation. The representation is so called unranked,...
Definition: UnrankedTree.h:69
return res
Definition: MinimizeByPartitioning.h:145
Definition: ToGrammar.h:31
Definition: BackwardOccurrenceTest.h:17