Go to the source code of this file.
|
class | automaton::DFTA< SymbolTypeT, StateTypeT > |
| Nondeterministic finite tree automaton without epsilon transitions. Accepts regular tree languages. More...
|
|
class | automaton::isDFTA_impl< T > |
|
class | automaton::isDFTA_impl< DFTA< SymbolType, StateType > > |
|
class | core::SetConstraint< automaton::DFTA< SymbolType, StateType >, common::ranked_symbol< SymbolType >, automaton::InputAlphabet > |
|
class | core::SetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::States > |
|
class | core::SetConstraint< automaton::DFTA< SymbolType, StateType >, StateType, automaton::FinalStates > |
|
struct | core::normalize< automaton::DFTA< SymbolType, StateType > > |
|