Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata.
Giovanna J. LavadoGiovanni PighizziniShinnosuke SekiPublished in: Developments in Language Theory (2012)
Keyphrases
- deterministic automata
- finite automata
- context free grammars
- grammatical inference
- regular expressions
- regular languages
- context free languages
- tree automata
- context free
- pattern matching
- predicate invention
- covering arrays
- positive data
- xml schema
- formal languages
- relational databases
- domain knowledge
- databases
- inductive inference
- query language