Reset Complexity of Ideal Languages Over a Binary Alphabet (Q5205048): Difference between revisions

@@ Property / cites work @@
+Slowly Synchronizing Automata and Digraphs
@@ Property / cites work: Slowly Synchronizing Automata and Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Completely Reachable Automata
@@ Property / cites work: Completely Reachable Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509690
@@ Property / cites work: Q5509690 / rank @@
+Normal rank
@@ Property / cites work @@
+The Černý conjecture and 1-contracting automata
@@ Property / cites work: The Černý conjecture and 1-contracting automata / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronizing Automata with Extremal Properties
@@ Property / cites work: Synchronizing Automata with Extremal Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Reset complexity of ideal languages over a binary alphabet
+Normal rank
@@ Property / cites work @@
+Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
+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 @@
+Q4385527
@@ Property / cites work: Q4385527 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronizing Automata and the Černý Conjecture
@@ Property / cites work: Synchronizing Automata and the Černý Conjecture / rank @@
+Normal rank