On stateless multihead automata: hierarchies and the emptiness problem (Q844888): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2009.09.001
@@ Property / DOI: 10.1016/j.tcs.2009.09.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
+Normal rank
@@ Property / cites work @@
+On Stateless Multihead Finite Automata and Multihead Pushdown Automata
+Normal rank
@@ Property / cites work @@
+Q3885190
@@ Property / cites work: Q3885190 / rank @@
+Normal rank
@@ Property / cites work @@
+On Multi-Head Finite Automata
@@ Property / cites work: On Multi-Head Finite Automata / rank @@
+Normal rank
@@ Property / cites work @@
+ON STATELESS AUTOMATA AND P SYSTEMS
@@ Property / cites work: ON STATELESS AUTOMATA AND P SYSTEMS / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>             + 1 Heads Are Better than             <i>k</i>
@@ Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2009.09.001
@@ Property / DOI: 10.1016/J.TCS.2009.09.001 / rank @@
+Normal rank