Sublogarithmic ambiguity

DOI10.1016/J.TCS.2005.07.024MaRDI QIDQ2575762zbMATH OpenOpenAlexFDO

Authors K. Wich

Publication date 6 December 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.07.024

zbMATH Keywords

AmbiguityFormal languagesContext-free languages

Mathematics Subject Classification ID

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

Recommendations

• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 1759455
• Exponential ambiguity of context-free grammars
• scientific article; zbMATH DE number 2086661
• Analytic models and ambiguity of context-free languages

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3480118 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3436630 (Why is no real title available?)
• scientific article; zbMATH DE number 1500544 (Why is no real title available?)
• scientific article; zbMATH DE number 1759455 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2086661 (Why is no real title available?)
• scientific article; zbMATH DE number 1834688 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A helpful result for proving inherent ambiguity
• Exponential ambiguity of context-free grammars
• Mathematical Foundations of Computer Science 2004
• Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
• On Context-Free Languages
• On the number of occurrences of a symbol in words of regular languages.
• One-way stack automata
• Optimization of LR(k) parsers
• Reversal-bounded multipushdown machines
• Some inherently ambiguous context-free languages

Cited in

(10)

• On differentiation functions, structure functions, and related languages of context-free grammars
• scientific article; zbMATH DE number 2086661 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• In memoriam Chandra Kintala
• scientific article; zbMATH DE number 7439739 (Why is no real title available?)
• Unambiguous Boolean grammars
• Exponential ambiguity of context-free grammars
• scientific article; zbMATH DE number 1759455 (Why is no real title available?)
• scientific article; zbMATH DE number 3911733 (Why is no real title available?)
• Analytic models and ambiguity of context-free languages

This page was built for publication: Sublogarithmic ambiguity

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