Approximating Minimum Reset Sequences (Q3073634): Difference between revisions

@@ Property / cites work @@
+Q5422244
@@ Property / cites work: Q5422244 / rank @@
+Normal rank
@@ Property / cites work @@
+Reset Sequences for Monotonic Automata
@@ Property / cites work: Reset Sequences for Monotonic Automata / rank @@
+Normal rank
@@ Property / cites work @@
+On two Combinatorial Problems Arising from Automata Theory
+Normal rank
@@ Property / cites work @@
+In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
+Normal rank
@@ Property / cites work @@
+Synchronizing generalized monotonic automata
@@ Property / cites work: Synchronizing generalized monotonic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronizing finite automata on Eulerian digraphs.
+Normal rank
@@ Property / cites work @@
+Approximating the minimum length of synchronizing words is hard
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding Reset Words in Finite Automata
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Synchronizing Automata and the Černý Conjecture
@@ Property / cites work: Synchronizing Automata and the Černý Conjecture / rank @@
+Normal rank