Circular Sturmian words and Hopcroft's algorithm (Q732029)

From MaRDI portal
Revision as of 02:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Circular Sturmian words and Hopcroft's algorithm
scientific article

    Statements

    title
    Circular Sturmian words and Hopcroft's algorithm (English)
    0 references
    author
    Antonio Restivo
    0 references
    Giuseppa Castiglione
    0 references
    Marinella Sciortino
    0 references
    publication date
    9 October 2009
    0 references
    zbMATH Keywords
    deterministic finite state automata
    0 references
    Hopcroft's minimization algorithm
    0 references
    circular Sturmian words
    0 references
    Sturmian morphisms
    0 references
    describes a project that uses
    AMoRE
    0 references
    OEIS
    0 references

    Identifiers

    zbMATH DE Number
    5612525
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q732029&oldid=25749392"
    Powered by MediaWiki