Normal forms of deterministic grammars

DOI10.1016/S0012-365X(76)80004-0zbMath0358.68108OpenAlexW2073820836MaRDI QIDQ1238425

Ivan M. Havel, Matthew M. Geller, Michael A. Harrison

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80004-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

A pumping lemma for deterministic context-free languages ⋮ On LLP(k) grammars and languages ⋮ A left part theorem for grammatical trees ⋮ On equivalence of grammars through transformation trees ⋮ Simple chain grammars and languages

Cites Work

• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• On LR(k) grammars and languages
• Internal and external stability of linear systems
• Strict deterministic grammars
• On the Parsing of Deterministic Languages
• Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
• On Bounded Right Context Languages and Grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Deterministic context free languages
• Syntax-Directed Transduction
• Properties of deterministic top-down grammars
• On the translation of languages from left to right
• A Formalization of Transition Diagram Systems
• Real-Time Strict Deterministic Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal forms of deterministic grammars