Tree-walking automata do not recognize all regular languages.
Mikolaj BojanczykThomas ColcombetPublished in: STOC (2005)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- context free grammars
- finite state machines
- pac learning
- pattern matching
- finite state automata
- positive data
- context free
- equivalence queries
- xml schema
- model checking
- uniform distribution
- decision trees
- object oriented
- statistical queries
- query language
- relational databases