Unambiguous conjunctive grammars over a one-symbol alphabet
From MaRDI portal
Publication:507593
DOI10.1016/j.tcs.2016.12.009zbMath1356.68121OpenAlexW2568674745MaRDI QIDQ507593
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.009
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)
Related Items (1)
Cites Work
- Unnamed Item
- 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 the expressive power of univariate equations over sets of natural numbers
- Complexity of equations over sets of natural numbers
- One-nonterminal conjunctive grammars over a unary alphabet
- On real time one-way cellular array
- Parsing Boolean grammars over a one-letter alphabet using online convolution
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Characterizations and computational complexity of systolic trellis automata
- Well-founded semantics for Boolean grammars
- Unambiguous Boolean grammars
- Decision problems for language equations
- On sparse languages \(L\) such that \(LL= \Sigma^*\)
- Boolean grammars
- Computational completeness of equations over sets of natural numbers
- An extension of context-free grammars with one-sided context specifications
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- The complexity of membership problems for circuits over sets of natural numbers
- Algorithmics on SLP-compressed strings: A survey
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Systolic trellis automatata †
- One-way bounded cellular automata
- Automatic Sequences
- On the equivalence of linear conjunctive grammars and trellis automata
- Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
This page was built for publication: Unambiguous conjunctive grammars over a one-symbol alphabet
