Nondeterminism Is Essential in Small 2FAs with Few Reversals (Q3012920): Difference between revisions

@@ Property / cites work @@
+Q4139689
@@ Property / cites work: Q4139689 / rank @@
+Normal rank
@@ Property / cites work @@
+Converting two-way nondeterministic unary automata into simpler automata.
+Normal rank
@@ Property / cites work @@
+Two-Way Unary Automata versus Logarithmic Space
@@ Property / cites work: Two-Way Unary Automata versus Logarithmic Space / rank @@
+Normal rank
@@ Property / cites work @@
+Q4465337
@@ Property / cites work: Q4465337 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449194
@@ Property / cites work: Q4449194 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Sweeping 2NFAs Are Not Closed Under Complement
+Normal rank
@@ Property / cites work @@
+Q3517105
@@ Property / cites work: Q3517105 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Way Automata versus Logarithmic Space
@@ Property / cites work: Two-Way Automata versus Logarithmic Space / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the size of sweeping automata
+Normal rank
@@ Property / cites work @@
+Nondeterminism and the size of two way finite automata
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of sweeping automata
@@ Property / cites work: Lower bounds on the size of sweeping automata / rank @@
+Normal rank