A hierarchy of deterministic languages

Michael A. Harrison*, Amiram Yehudai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


An infinite hierarchy of deterministic context free languages is introduced. The hierarchy is defined by the number of accepting configurations required by deterministic pushdown automata recognizing the languages. The hierarchy is related to some well-known language families. As a consequence we get "relative closure" results for certain subfamilies of the deterministic languages.

Original languageEnglish
Pages (from-to)63-78
Number of pages16
JournalJournal of Computer and System Sciences
Issue number1
StatePublished - Aug 1979
Externally publishedYes


FundersFunder number
National Science Foundation of Computer Science
Tel-Aviv University


    Dive into the research topics of 'A hierarchy of deterministic languages'. Together they form a unique fingerprint.

    Cite this