Conjunctive Grammars with Restricted Disjunction

DOI10.1007/978-3-540-95891-8_39zbMath1206.68161OpenAlexW1714715315MaRDI QIDQ3599090

Christian Reitwießner, Alexander Okhotin

Publication date: 3 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_39

Mathematics Subject Classification ID

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

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unambiguous Boolean grammars
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• On the Computational Completeness of Equations over Sets of Natural Numbers
• CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Two Families of Languages Related to ALGOL

This page was built for publication: Conjunctive Grammars with Restricted Disjunction