Tree-Walking Automata Do Not Recognize All Regular Languages.
Mikolaj BojanczykThomas ColcombetPublished in: SIAM J. Comput. (2008)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- finite state automata
- positive data
- context free grammars
- pac learning
- finite state machines
- context free
- pattern matching
- equivalence queries
- xml schema
- query language
- inductive inference
- learning algorithm
- query evaluation
- statistical queries
- model checking
- training data