Zielonka DAG acceptance and regular languages over infinite words (Q6067335): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Why These Automata Types? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherent size blowup in \(\omega\)-automata / 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: Q4027622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modalities for model checking: Branching time logic strikes back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ω-regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank

Latest revision as of 10:53, 19 August 2024

scientific article; zbMATH DE number 7766940
Language Label Description Also known as
English
Zielonka DAG acceptance and regular languages over infinite words
scientific article; zbMATH DE number 7766940

    Statements