Finite generation of ambiguity in context-free languages

DOI10.1016/0022-4049(89)90033-9zbMath0666.20030OpenAlexW2071745639MaRDI QIDQ1117043

Dana May Latch

Publication date: 1989

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(89)90033-9

zbMATH Keywords

context-free languageambiguitycongruencecontext-free grammarintersectionfinitely presentedundecidable problemscategorical presentationcategory of derivationscontext-free languages generationintersection components

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Special categories (18B99)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unification algorithm for typed \(\bar\lambda\)-calculus
• Linear unification
• An algebraic model for programming languages
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Categorical and topological aspects of formal languages
• An Efficient Unification Algorithm
• The basic algebraic structures in categories of derivations
• Can programming be liberated from the von Neumann style?
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Finite generation of ambiguity in context-free languages