Converting Self-verifying Automata into Deterministic Automata (Q3618603): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-00982-2_39
+Normal rank
@@ Property / OpenAlex ID @@
+W1569273857
@@ Property / OpenAlex ID: W1569273857 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422234
@@ Property / cites work: Q5422234 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / 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 @@
+Nondeterministic Communication with a Limited Number of Advice Bits
+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 @@
+An upper bound for transforming self-verifying automata into deterministic ones
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Complementing unary nondeterministic automata
@@ Property / cites work: Complementing unary nondeterministic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4531373
@@ Property / cites work: Q4531373 / rank @@
+Normal rank