A simple P-complete problem and its language-theoretic representations (Q616494): Difference between revisions

@@ Property / cites work @@
+Q5321501
@@ Property / cites work: Q5321501 / rank @@
+Normal rank
@@ Property / cites work @@
+Systolic trellis automatata †
@@ Property / cites work: Systolic trellis automatata † / rank @@
+Normal rank
@@ Property / cites work @@
+Systolic trellis automatat†
@@ Property / cites work: Systolic trellis automatat† / rank @@
+Normal rank
@@ Property / cites work @@
+One-way bounded cellular automata
@@ Property / cites work: One-way bounded cellular automata / rank @@
+Normal rank
@@ Property / cites work @@
+Parsing expression grammars
@@ Property / cites work: Parsing expression grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
+Normal rank
@@ Property / cites work @@
+Two Families of Languages Related to ALGOL
@@ Property / cites work: Two Families of Languages Related to ALGOL / rank @@
+Normal rank
@@ Property / cites work @@
+Q4128417
@@ Property / cites work: Q4128417 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4843270
@@ Property / cites work: Q4843270 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations and computational complexity of systolic trellis automata
+Normal rank
@@ Property / cites work @@
+Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
+Normal rank
@@ Property / cites work @@
+Well-founded semantics for Boolean grammars
@@ Property / cites work: Well-founded semantics for Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586325
@@ Property / cites work: Q5586325 / rank @@
+Normal rank
@@ Property / cites work @@
+P-completeness of Cellular Automaton Rule 110
@@ Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Weakly Universal Turing Machines
@@ Property / cites work: Small Weakly Universal Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4531380
@@ Property / cites work: Q4531380 / rank @@
+Normal rank
@@ Property / cites work @@
+The hardest linear conjunctive language
@@ Property / cites work: The hardest linear conjunctive language / rank @@
+Normal rank
@@ Property / cites work @@
+On the equivalence of linear conjunctive grammars and trellis automata
+Normal rank
@@ Property / cites work @@
+On the number of nonterminals in linear conjunctive grammars
+Normal rank
@@ Property / cites work @@
+Boolean grammars
@@ Property / cites work: Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+The dual of concatenation
@@ Property / cites work: The dual of concatenation / rank @@
+Normal rank
@@ Property / cites work @@
+GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
+Normal rank
@@ Property / cites work @@
+Recursive descent parsing for Boolean grammars
@@ Property / cites work: Recursive descent parsing for Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Expressive Power of LL(k) Boolean Grammars
@@ Property / cites work: Expressive Power of LL(k) Boolean Grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Real-time language recognition by one-dimensional cellular automata
+Normal rank
@@ Property / cites work @@
+A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
+Normal rank
@@ Property / cites work @@
+On real time one-way cellular array
@@ Property / cites work: On real time one-way cellular array / rank @@
+Normal rank