An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Journal of Computer and System Sciences
Musings around the geometry of interaction, and coherence
Theoretical Computer Science
Strict deterministic aspects of minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.01 |
A grammatical definition of a family of deterministic context free languages is presented. It is very easy to decide if a context free grammar is strict deterministic. A characterization theorem involving pushdown automata is proved, and it follows that the strict deterministic languages are coextensive with the family of prefix free deterministic languages. It is possible to obtain an infinite hierarchy of strict deterministic languages as defined by their degree.