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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of automata on \(\omega\)-tapes: a simplified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5660494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Star-Free Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free regular sets of ω-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to the theory of ω-automata / rank
 
Normal rank

Latest revision as of 15:39, 15 May 2024

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