TYPENESS FOR ω-REGULAR AUTOMATA
From MaRDI portal
Recommendations
Cites work
- A classification of \(\omega\)-regular languages
- Alternating finite automata on -words
- An automata-theoretic approach to branching-time model checking
- Decision problems forω-automata
- From linear time to branching time
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- On syntactic congruences for \(\omega\)-languages
- Reasoning about infinite computations
- Testing and generating infinite sequences by a finite automaton
Cited in
(17)- Alternation and -type Turing acceptors
- Cycle detection in computation tree logic
- Certifying inexpressibility
- Types from Frames as Finite Automata
- Co-Büching them all
- Automata theory and model checking
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- The quest for a tight translation of Büchi to co-Büchi automata
- scientific article; zbMATH DE number 1555955 (Why is no real title available?)
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- On the (in)succinctness of Muller automata
- How deterministic are good-for-games automata?
- Automated Technology for Verification and Analysis
- scientific article; zbMATH DE number 7770050 (Why is no real title available?)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- The complexity of simplifying -automata through the alternating cycle decomposition
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)
