Freezing 1-Tag Systems with States (Q6204127): Difference between revisions

@@ Property / cites work @@
+One-Way Jumping Finite Automata
@@ Property / cites work: One-Way Jumping Finite Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Universality of Tag Systems with             <i>P</i>             = 2
@@ Property / cites work: Universality of Tag Systems with <i>P</i> = 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5321501
@@ Property / cites work: Q5321501 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5867520
@@ Property / cites work: Q5867520 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091013
@@ Property / cites work: Q5091013 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-free languages can be accepted with absolutely no space overhead
+Normal rank
@@ Property / cites work @@
+Topological sorting of large networks
@@ Property / cites work: Topological sorting of large networks / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptional complexity of iterated uniform finite-state transducers
+Normal rank
@@ Property / cites work @@
+Queue Automata: Foundations and Developments
@@ Property / cites work: Queue Automata: Foundations and Developments / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of the Queue
@@ Property / cites work: The Power of the Queue / rank @@
+Normal rank
@@ Property / cites work @@
+Q5507033
@@ Property / cites work: Q5507033 / rank @@
+Normal rank
@@ Property / cites work @@
+A variant of a recursively unsolvable problem
@@ Property / cites work: A variant of a recursively unsolvable problem / rank @@
+Normal rank
@@ Property / cites work @@
+A pumping lemma for deterministic context-free languages
+Normal rank
@@ Property / cites work @@
+Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6204127