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