\(\omega\)-languages accepted by finite automata whose structures are cascade products o resets (Q1183179)

From MaRDI portal
Revision as of 17:24, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
\(\omega\)-languages accepted by finite automata whose structures are cascade products o resets
scientific article

    Statements

    \(\omega\)-languages accepted by finite automata whose structures are cascade products o resets (English)
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    star-free \(\omega\)-regular languages
    0 references
    star-free regular sets
    0 references