Inherent ambiguity of minimal linear grammars

DOI10.1016/S0019-9958(64)90422-XzbMATH Open0134.24604DBLPjournals/iandc/Gross64WikidataQ56387031 ScholiaQ56387031MaRDI QIDQ5344974FDOQ5344974

Authors: Maurice Gross 

Publication date: 1964

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

mathematical logic

Cited In (7)

• UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES
• The theory of languages
• Coding by minimal linear grammars
• The theory of languages
• On the Commutative Equivalence of Algebraic Formal Series and Languages
• On bounded linear codes and the commutative equivalence
• Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

This page was built for publication: Inherent ambiguity of minimal linear grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5344974)