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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Christoffel classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Átomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Challenging Family of Automata for Classical Minimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopcroft’s Algorithm and Cyclic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Sturmian words and Hopcroft's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal cases of Hopcroft's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopcroft's algorithm and tree-like automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words, Trees and Automata Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial double reversal minimization algorithm for deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations of balanced words via orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic Sturmian words are extremal for the critical factorization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time solution to the single function coarsest partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Automata and Standard Sturmian Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank

Revision as of 18:26, 10 July 2024

scientific article
Language Label Description Also known as
English
Standard Sturmian words and automata minimization algorithms
scientific article

    Statements

    Standard Sturmian words and automata minimization algorithms (English)
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    standard Sturmian words
    0 references
    automata minimization
    0 references
    Brzozowski's minimization algorithm
    0 references

    Identifiers