Characterization of context-free languages with polynomially bounded ambiguity

DOI10.1007/3-540-44683-4_61MaRDI QIDQ4779185zbMATH OpenFDO

Authors K. Wich

Publication date 25 November 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360703

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Analytic models and ambiguity of context-free languages
• Ambiguity in omega context free languages
• Sublinear ambiguity
• scientific article; zbMATH DE number 3856428
• Finite generation of ambiguity in context-free languages

Cited in

(6)

• Sublogarithmic ambiguity
• THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES
• On universally polynomial context-free languages
• The inherent ambiguity partial algorithm problem for context free languages
• Semi-linearity, Parikh-boundedness and tree adjunct languages
• A note on the expressive power of probabilistic context free grammars

This page was built for publication: Characterization of context-free languages with polynomially bounded ambiguity

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