Circular Sturmian words and Hopcroft's algorithm (Q732029): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2959876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an involution of Christoffel words and Sturmian morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Christoffel classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hopcroft’s Algorithm and Cyclic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in Sturmian strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing an algorithm by Hopcroft / 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: Re-describing an algorithm by Hopcroft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank

Latest revision as of 00:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Circular Sturmian words and Hopcroft's algorithm
scientific article

    Statements

    Circular Sturmian words and Hopcroft's algorithm (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2009
    0 references
    deterministic finite state automata
    0 references
    Hopcroft's minimization algorithm
    0 references
    circular Sturmian words
    0 references
    Sturmian morphisms
    0 references
    0 references
    0 references

    Identifiers