Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata.
Giovanna J. LavadoGiovanni PighizziniShinnosuke SekiPublished in: Inf. Comput. (2013)
Keyphrases
- deterministic automata
- finite automata
- context free grammars
- grammatical inference
- regular expressions
- regular languages
- tree automata
- context free languages
- context free
- positive data
- inductive inference
- domain knowledge
- predicate invention
- formal languages
- knowledge base
- production rules
- xml schema
- pattern matching
- tree adjoining