Oblivious two-way finite automata: decidability and complexity (Q2252534): Difference between revisions

@@ Property / Wikidata QID @@
+Q61677492
@@ Property / Wikidata QID: Q61677492 / 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.1016/j.ic.2014.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1992529316
@@ Property / OpenAlex ID: W1992529316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4139689
@@ Property / cites work: Q4139689 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3938525
@@ Property / cites work: Q3938525 / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection and union of regular languages and state complexity
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
+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 @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Multi-head finite automata: Data-independent versus data-dependent computations
+Normal rank
@@ Property / cites work @@
+Q3102144
@@ Property / cites work: Q3102144 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of multi-head finite automata: origins and directions
+Normal rank
@@ Property / cites work @@
+Q4449194
@@ Property / cites work: Q4449194 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5192988
@@ Property / cites work: Q5192988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133162
@@ Property / cites work: Q4133162 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / 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 @@
+Size complexity of rotating and sweeping automata
@@ Property / cites work: Size complexity of rotating and sweeping automata / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Way Automata Characterizations of L/poly versus NL
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the size of sweeping automata
+Normal rank
@@ Property / cites work @@
+Q5192992
@@ Property / cites work: Q5192992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5554980
@@ Property / cites work: Q5554980 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way deterministic finite automata are exponentially more succinct than sweeping automata
+Normal rank
@@ Property / cites work @@
+On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Q4055196
@@ Property / cites work: Q4055196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218105
@@ Property / cites work: Q4218105 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations Among Complexity Measures
@@ Property / cites work: Relations Among Complexity Measures / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism and the size of two way finite automata
+Normal rank
@@ Property / cites work @@
+The network complexity and the Turing machine complexity of finite functions
+Normal rank
@@ Property / cites work @@
+Halting space-bounded computations
@@ Property / cites work: Halting space-bounded computations / rank @@
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:2252534