Standard Sturmian words and automata minimization algorithms (Q496057): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.07.023
@@ Property / DOI: 10.1016/j.tcs.2015.07.023 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+OEIS
@@ Property / describes a project that uses: OEIS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.07.023
+Normal rank
@@ Property / OpenAlex ID @@
+W915075976
@@ Property / OpenAlex ID: W915075976 / 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 @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+On Christoffel classes
@@ Property / cites work: On Christoffel classes / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of Átomata
@@ Property / cites work: Theory of Átomata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+A Challenging Family of Automata for Classical Minimization Algorithms
+Normal rank
@@ Property / cites work @@
+Hopcroft’s Algorithm and Cyclic Automata
@@ Property / cites work: Hopcroft’s Algorithm and Cyclic Automata / 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 @@
+Hopcroft's algorithm and tree-like automata
@@ Property / cites work: Hopcroft's algorithm and tree-like automata / rank @@
+Normal rank
@@ Property / cites work @@
+Words, Trees and Automata Minimization
@@ Property / cites work: Words, Trees and Automata Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
+Normal rank
@@ Property / cites work @@
+Q4362734
@@ Property / cites work: Q4362734 / 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 @@
+A polynomial double reversal minimization algorithm for deterministic finite automata
+Normal rank
@@ Property / cites work @@
+EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM
+Normal rank
@@ Property / cites work @@
+Q4045961
@@ Property / cites work: Q4045961 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterisations of balanced words via orderings
@@ Property / cites work: Characterisations of balanced words via orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Burrows-Wheeler transform and Sturmian words
@@ Property / cites work: Burrows-Wheeler transform and Sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+Characteristic Sturmian words are extremal for the critical factorization theorem
+Normal rank
@@ Property / cites work @@
+A linear time solution to the single function coarsest partition problem
+Normal rank
@@ Property / cites work @@
+Suffix Automata and Standard Sturmian Words
@@ Property / cites work: Suffix Automata and Standard Sturmian Words / rank @@
+Normal rank
@@ Property / cites work @@
+Q2859380
@@ Property / cites work: Q2859380 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.07.023
@@ Property / DOI: 10.1016/J.TCS.2015.07.023 / rank @@
+Normal rank