Conjunctive grammars with restricted disjunction
From MaRDI portal
Publication:974750
DOI10.1016/J.TCS.2010.03.015zbMATH Open1203.68078OpenAlexW1990727398MaRDI QIDQ974750FDOQ974750
Christian Reitwießner, Alexander Okhotin
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.015
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Two Families of Languages Related to ALGOL
- Recursive descent parsing for Boolean grammars
- Unambiguous Boolean grammars
- On the Computational Completeness of Equations over Sets of Natural Numbers
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Cited In (12)
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- The hardest language for grammars with context operators
- An extension of context-free grammars with one-sided context specifications
- Hardest languages for conjunctive and Boolean grammars
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Language equations with complementation: expressive power
- Conjunctive grammars and alternating pushdown automata
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
- The Hardest Language for Conjunctive Grammars
- Language equations
- Title not available (Why is that?)
- Conjunctive Grammars with Restricted Disjunction
Uses Software
This page was built for publication: Conjunctive grammars with restricted disjunction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974750)
