Complementing two-way finite automata (Q2643079): Difference between revisions

@@ Property / Wikidata QID @@
+Q57380787
@@ Property / Wikidata QID: Q57380787 / 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.2007.01.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1989657066
@@ Property / OpenAlex ID: W1989657066 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4139689
@@ Property / cites work: Q4139689 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact lower time bounds for computing Boolean functions on CREW PRAMs
+Normal rank
@@ Property / cites work @@
+Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space
+Normal rank
@@ Property / cites work @@
+Converting two-way nondeterministic unary automata into simpler automata.
+Normal rank
@@ Property / cites work @@
+Q5422234
@@ Property / cites work: Q5422234 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of Las Vegas II: Two-way finite automata
+Normal rank
@@ Property / cites work @@
+On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
+Normal rank
@@ Property / cites work @@
+Q3517105
@@ Property / cites work: Q3517105 / rank @@
+Normal rank
@@ Property / cites work @@
+Complementing unary nondeterministic automata
@@ Property / cites work: Complementing unary nondeterministic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503152
@@ Property / cites work: Q4503152 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum automata and quantum grammars
@@ Property / cites work: Quantum automata and quantum grammars / rank @@
+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 @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+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
@@ Property / cites work @@
+Halting space-bounded computations
@@ Property / cites work: Halting space-bounded computations / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+A note on the reduction of two-way automata to one-way automata
+Normal rank
@@ Property / DBLP publication ID @@
+journals/iandc/GeffertMP07
@@ Property / DBLP publication ID: journals/iandc/GeffertMP07 / rank @@
+Normal rank