Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.
Giovanni PighizziniJeffrey O. ShallitMing-wei WangPublished in: J. Comput. Syst. Sci. (2002)
Keyphrases
- context free grammars
- lower bound
- tree automata
- context free
- upper bound
- regular expressions
- formal languages
- grammatical inference
- context free languages
- regular languages
- attribute grammars
- pairwise
- objective function
- finite automata
- predicate invention
- finite state
- database
- knowledge based systems
- np hard
- vc dimension
- equivalence queries
- knowledge structures
- high level
- knowledge base