Inherent ambiguity of minimal linear grammars
From MaRDI portal
Publication:5344974
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)