A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644): Difference between revisions

@@ Property / cites work @@
+Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality
+Normal rank
@@ Property / cites work @@
+Enumeration and generation with a string automata representation
+Normal rank
@@ Property / cites work @@
+Q5389971
@@ Property / cites work: Q5389971 / rank @@
+Normal rank
@@ Property / cites work @@
+Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
+Normal rank
@@ Property / cites work @@
+Sturmian trees
@@ Property / cites work: Sturmian trees / rank @@
+Normal rank
@@ Property / cites work @@
+Circular Sturmian words and Hopcroft's algorithm
@@ Property / cites work: Circular Sturmian words and Hopcroft's algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On extremal cases of Hopcroft's algorithm
@@ Property / cites work: On extremal cases of Hopcroft's algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Some combinatorial properties of Sturmian words
@@ Property / cites work: Some combinatorial properties of Sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+Minimisation of acyclic deterministic automata in linear time
+Normal rank
@@ Property / cites work @@
+Experimental Evaluation of Classical Automata Constructions
+Normal rank