On the Size Complexity of Rotating and Sweeping Automata (Q3533032): Difference between revisions

@@ Property / author @@
-Christos A. Kapoutsis
@@ Property / author: Christos A. Kapoutsis / rank @@
-Normal rank
@@ Property / author @@
+Christos A. Kapoutsis
@@ Property / author: Christos A. Kapoutsis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85780-8_36
+Normal rank
@@ Property / OpenAlex ID @@
+W1524385326
@@ Property / OpenAlex ID: W1524385326 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3938525
@@ Property / cites work: Q3938525 / rank @@
+Normal rank
@@ Property / cites work @@
+Complementing two-way finite automata
@@ Property / cites work: Complementing two-way finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata
+Normal rank
@@ Property / cites work @@
+Two-way deterministic finite automata are exponentially more succinct than 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