ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM (Q3348430)

From MaRDI portal
Revision as of 11:02, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM
scientific article

    Statements

    title
    ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM (English)
    0 references
    author
    David E. Muller
    0 references
    Paul E. Schupp
    0 references
    Ahmed Saoudi
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    tree automata
    0 references
    Büchi automata
    0 references
    Muller automata
    0 references
    Rabin automata
    0 references

    Identifiers

    zbMATH DE Number
    4199646
    0 references
    OpenAlex ID
    W2078989139
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3348430&oldid=37391346"
    Powered by MediaWiki