Hardest languages for conjunctive and Boolean grammars
From MaRDI portal
Publication:1740643
DOI10.1016/j.ic.2018.11.001zbMath1426.68152OpenAlexW2905324368MaRDI QIDQ1740643
Publication date: 2 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2018.11.001
Related Items (5)
The hardest \(\operatorname{LL}(k)\) language ⋮ The hardest language for grammars with context operators ⋮ The Hardest LL(k) Language ⋮ On hardest languages for one-dimensional cellular automata ⋮ On hardest languages for one-dimensional cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parsing by matrix multiplication generalized to Boolean grammars
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- On real time one-way cellular array
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Well-founded semantics for Boolean grammars
- Conjunctive grammars with restricted disjunction
- On morphic generation of regular languages
- On multiple context-free grammars
- Tree adjunct grammars
- A tale of conjunctive grammars
- Underlying principles and recurring ideas of formal grammars
- Boolean grammars
- An extension of context-free grammars with one-sided context specifications
- Two-sided context specifications in formal grammars
- Recognition of poly-slender context-free languages by trellis automata
- The Missing Case in Chomsky-Schützenberger Theorem
- Homomorphic Characterizations of Indexed Languages
- BOOLEAN GRAMMARS AND GSM MAPPINGS
- Non-erasing Variants of the Chomsky–Schützenberger Theorem
- Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
- Visibly pushdown languages
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Non-prinicipalité du cylindre des langages à compteur
- Le cylindre des langages linéaires
- The Hardest Context-Free Language
- Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
- On the equivalence of linear conjunctive grammars and trellis automata
- Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives
- Syntactic Analysis and Operator Precedence
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
This page was built for publication: Hardest languages for conjunctive and Boolean grammars
