\( \omega \)-automata
From MaRDI portal
Publication:2074208
DOI10.4171/Automata-1/6OpenAlexW4200240938MaRDI QIDQ2074208
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Finite-state \(\omega\)-languages
- Alternating finite automata on \(\omega\)-words
- A syntactic congruence for rational \(\omega\)-languages
- Alternating automata on infinite trees
- Alternating automata, the weak monadic theory of trees and its complexity
- Borel determinacy
- Reasoning about infinite computations
- Unambiguous Büchi automata.
- Efficient minimization of deterministic weak \(\omega\)-automata
- Complementing semi-deterministic Büchi automata
- Minimizing nfa's and regular expressions
- Improved Ramsey-Based Büchi Complementation
- Forms of Determinism for Automata (Invited Talk)
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Determinising Parity Automata
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
- Weak alternating automata are not that weak
- The Büchi Complementation Saga
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Tighter Bounds for the Determinisation of Büchi Automata
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Propositional dynamic logic of looping and converse is elementarily decidable
- The complexity of propositional linear temporal logics
- On the power of bounded concurrency I
- The complexity of probabilistic verification
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
- An effective decision procedure for linear arithmetic over the integers and reals
- Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Lazy probabilistic model checking without determinisation
- Büchi Complementation Made Tight
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Solving Sequential Conditions by Finite-State Strategies
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: \( \omega \)-automata
