A note on partially ordered tree automata.
Pierre-Cyrille HéamPublished in: Inf. Process. Lett. (2008)
Keyphrases
- learning algorithm
- partially ordered
- tree automata
- partial order
- regular expressions
- finite automata
- finite state
- tree languages
- partial ordering
- totally ordered
- machine learning
- event calculus
- syntactic pattern recognition
- finite automaton
- context free grammars
- total ordering
- expert systems
- context free
- context sensitive
- integrity constraints
- natural language processing
- data model