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