A classification of \(\omega\)-regular languages (Q1058863): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5525343 / 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: Sets of Numbers Defined by Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems forω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(\omega\)-regular languages / rank
 
Normal rank

Latest revision as of 17:50, 14 June 2024

scientific article
Language Label Description Also known as
English
A classification of \(\omega\)-regular languages
scientific article

    Statements

    A classification of \(\omega\)-regular languages (English)
    0 references
    0 references
    1985
    0 references
    For a given \(\omega\)-regular language A we establish an invariant property of the structure of finite automata which accept A.
    0 references
    0 references
    omega-regular language
    0 references
    finite automata
    0 references