A COMPLEX MEASURE FOR LINEAR GRAMMARS

DOI10.1515/DEMA-2005-0323MaRDI QIDQ5703664zbMATH OpenOpenAlexFDO

Authors

Publication date 8 November 2005

Published in Demonstratio Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1515/dema-2005-0323

zbMATH Keywords

discrete-event supervisory controllanguage measurelinear grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Axiomatic systems theory (93A05) Discrete event control/observation systems (93C65)

Recommendations

• A note on the equivalence and complexity of linear grammars
• scientific article; zbMATH DE number 522856
• Linear graph grammars: Power and complexity
• On some constructions of grammars for linear languages
• scientific article; zbMATH DE number 4043267
• scientific article; zbMATH DE number 3843141
• Complexity of problems of commutative grammars
• scientific article; zbMATH DE number 1355184
• Derivational complexity of context-free grammars
• Complexity in left-associative grammar

Cited in

(3)

• Complex systems, complexity measures, grammars and model-inferring
• A note on the equivalence and complexity of linear grammars
• Linear graph grammars: Power and complexity

This page was built for publication: A COMPLEX MEASURE FOR LINEAR GRAMMARS

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