On hardest languages for one-dimensional cellular automata (Q2232270): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-68195-1_10
+Normal rank
@@ Property / OpenAlex ID @@
+W3131350852
@@ Property / OpenAlex ID: W3131350852 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-prinicipalité du cylindre des langages à compteur
+Normal rank
@@ Property / cites work @@
+Le cylindre des langages linéaires
@@ Property / cites work: Le cylindre des langages linéaires / rank @@
+Normal rank
@@ Property / cites work @@
+Q3339293
@@ Property / cites work: Q3339293 / rank @@
+Normal rank
@@ Property / cites work @@
+On time computability of functions in one-way cellular automata
+Normal rank
@@ Property / cites work @@
+On real-time cellular automata and trellis automata
+Normal rank
@@ Property / cites work @@
+Variations of the firing squad problem and applications
+Normal rank
@@ Property / cites work @@
+Q3870326
@@ Property / cites work: Q3870326 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / rank @@
+Normal rank
@@ Property / cites work @@
+Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
+Normal rank
@@ Property / cites work @@
+On morphic generation of regular languages
@@ Property / cites work: On morphic generation of regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Relating the power of cellular arrays to their closure properties
+Normal rank
@@ Property / cites work @@
+Characterizations and computational complexity of systolic trellis automata
+Normal rank
@@ Property / cites work @@
+A six-state minimal time solution to the Firing squad synchronization problem
+Normal rank
@@ Property / cites work @@
+Q4531380
@@ Property / cites work: Q4531380 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean grammars
@@ Property / cites work: Boolean grammars / rank @@
+Normal rank
@@ Property / cites work @@
+On the equivalence of linear conjunctive grammars and trellis automata
+Normal rank
@@ Property / cites work @@
+Q5313800
@@ Property / cites work: Q5313800 / rank @@
+Normal rank
@@ Property / cites work @@
+A tale of conjunctive grammars
@@ Property / cites work: A tale of conjunctive grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Hardest languages for conjunctive and Boolean grammars
+Normal rank
@@ Property / cites work @@
+Real-time language recognition by one-dimensional cellular automata
+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
@@ Property / cites work @@
+Language not recognizable in real time by one-way cellular automata
+Normal rank
@@ Property / cites work @@
+Closure properties of cellular automata
@@ Property / cites work: Closure properties of cellular automata / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of poly-slender context-free languages by trellis automata
+Normal rank
@@ Property / cites work @@
+A property of real-time trellis automata
@@ Property / cites work: A property of real-time trellis automata / rank @@
+Normal rank