TYPENESS FOR ω-REGULAR AUTOMATA
From MaRDI portal
Publication:5484907
DOI10.1142/S0129054106004157zbMATH Open1098.68073MaRDI QIDQ5484907FDOQ5484907
Gila Morgenstern, Orna Kupferman, Aniello Murano
Publication date: 21 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Reasoning about infinite computations
- An automata-theoretic approach to branching-time model checking
- Alternating finite automata on \(\omega\)-words
- On syntactic congruences for \(\omega\)-languages
- Testing and generating infinite sequences by a finite automaton
- Decision problems forω-automata
- From linear time to branching time
- A classification of \(\omega\)-regular languages
Cited In (13)
- Alternation and \(\omega\)-type Turing acceptors
- Certifying inexpressibility
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata Theory and Model Checking
- How Deterministic are Good-For-Games Automata?
- Cycle detection in computation tree logic
- Title not available (Why is that?)
- Types from Frames as Finite Automata
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- The Quest for a Tight Translation of Büchi to co-Büchi Automata
This page was built for publication: TYPENESS FOR ω-REGULAR AUTOMATA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484907)
