Finding DFAs with Maximal Shortest Synchronizing Word Length (Q5739001): Difference between revisions

@@ Property / cites work @@
+Representation theory of finite semigroups, semigroup radicals and formal language theory
+Normal rank
@@ Property / cites work @@
+A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
+Normal rank
@@ Property / cites work @@
+DFAs and PFAs with long shortest synchronizing word length
+Normal rank
@@ Property / cites work @@
+An extremal problem for two families of sets
@@ Property / cites work: An extremal problem for two families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q2729242
@@ Property / cites work: Q2729242 / rank @@
+Normal rank
@@ Property / cites work @@
+On two Combinatorial Problems Arising from Automata Theory
+Normal rank
@@ Property / cites work @@
+Q5192683
@@ Property / cites work: Q5192683 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551185
@@ Property / cites work: Q5551185 / rank @@
+Normal rank
@@ Property / cites work @@
+The Černý conjecture for one-cluster automata with prime length cycle
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
+Normal rank
@@ Property / cites work @@
+Synchronizing Automata and the Černý Conjecture
@@ Property / cites work: Synchronizing Automata and the Černý Conjecture / rank @@
+Normal rank