On tape-bounded complexity classes and multihead finite automata (Q1215271): Difference between revisions

@@ Property / cites work @@
+Multi-tape and multi-head pushdown automata
@@ Property / cites work: Multi-tape and multi-head pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+On non-determinacy in simple computing devices
@@ Property / cites work: On non-determinacy in simple computing devices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+On two-way multihead automata
@@ Property / cites work: On two-way multihead automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5180413
@@ Property / cites work: Q5180413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / 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 @@
+A note on multihead automata and context-sensitive languages
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+One-way multihead writing finite automata
@@ Property / cites work: One-way multihead writing finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-reversal multihead finite automata languages
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(75)80014-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1989382950
@@ Property / OpenAlex ID: W1989382950 / rank @@
+Normal rank