Sublinear ambiguity

DOI10.1007/3-540-44612-5_64MaRDI QIDQ4536405zbMATH OpenFDO

Authors K. Wich

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_64

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Sublogarithmic ambiguity
• Exponential ambiguity of context-free grammars
• Mathematical Foundations of Computer Science 2004
• Analytic models and ambiguity of context-free languages
• Ambiguity in omega context free languages

Cited in

(12)

• Finite generation of ambiguity in context-free languages
• Ambiguity in omega context free languages
• On the number of occurrences of a symbol in words of regular languages.
• Sublinear exaves
• On the degrees of non-regularity and non-context-freeness
• Sublogarithmic ambiguity
• Exponential ambiguity of context-free grammars
• A tree-height hierarchy of context-free languages
• Growth and ergodicity of context-free languages II: The linear case
• Characterization of context-free languages with polynomially bounded ambiguity
• Mathematical Foundations of Computer Science 2004
• On languages generated by signed grammars

This page was built for publication: Sublinear ambiguity

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