A hierarchy of deterministic languages

DOI10.1016/0022-0000(79)90014-XzbMath0426.68067MaRDI QIDQ1136238

Amiram Yehudai, Michael A. Harrison

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

deterministic pushdown automatarecognition of languagesinfinite hierarchy of deterministic context-free languagesinfinite hierarchy of regular languagesrelative closure propertiesunbounded automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the descriptive power of simple precedence grammars, Epsilon weak precedence grammars and languages, A hierarchy of real-time deterministic languages and their equivalence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On LR(k) grammars and languages
• A representation of trees by languages. I
• Strict deterministic grammars
• Linear Automaton Transformations
• Regularity and Related Problems for Deterministic Pushdown Automata
• A regularity test for pushdown machines
• On the translation of languages from left to right