Reset complexity and completely reachable automata with simple idempotents (Q2112183): Difference between revisions

@@ Property / cites work @@
+Groups synchronizing a transformation of non-uniform kernel
+Normal rank
@@ Property / cites work @@
+Preimage problems for deterministic finite automata
+Normal rank
@@ Property / cites work @@
+Completely Reachable Automata
@@ Property / cites work: Completely Reachable Automata / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of completely reachable automata
+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 @@
+Q5208375
@@ Property / cites work: Q5208375 / rank @@
+Normal rank
@@ Property / cites work @@
+Finitely Generated Ideal Languages and Synchronizing Automata
+Normal rank
@@ Property / cites work @@
+Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
+Normal rank
@@ Property / cites work @@
+State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
+Normal rank
@@ Property / cites work @@
+Sync-maximal permutation groups equal primitive permutation groups
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846425
@@ Property / cites work: Q4846425 / rank @@
+Normal rank
@@ Property / cites work @@
+Reset Complexity of Ideal Languages Over a Binary Alphabet
+Normal rank
@@ Property / cites work @@
+Ideal regular languages and strongly connected synchronizing automata
+Normal rank
@@ Property / cites work @@
+Polynomial complete problems in automata theory
@@ Property / cites work: Polynomial complete problems in automata theory / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of the length of reset words for automata with simple idempotents
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+An improvement to a recent upper bound for synchronizing words of finite automata
+Normal rank
@@ Property / cites work @@
+Černý's conjecture and the road colouring problem
+Normal rank