\( \omega \)-automata
type: Item
instance of: scholarly article
title: \( \omega \)-automata
author: Thomas Wilke
author: Sven Schewe
publication date: 2022-02-04T00:00:00Z
review text: Summary: For the entire collection see [Zbl 1470.68001].
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7469504
MaRDI profile type: Publication
cites work: Learning regular omega languages
cites work: A syntactic congruence for rational \(\omega\)-languages
cites work: Complementing semi-deterministic Büchi automata
cites work: An effective decision procedure for linear arithmetic over the integers and reals
cites work: Improved Ramsey-Based Büchi Complementation
cites work: Q5525343
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Unambiguous Büchi automata.
cites work: Forms of determinism for automata
cites work: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
cites work: The complexity of probabilistic verification
cites work: On the power of bounded concurrency I
cites work: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
cites work: BÜCHI COMPLEMENTATION MADE TIGHTER
cites work: Minimizing nfa's and regular expressions
cites work: Lazy probabilistic model checking without determinisation
cites work: Q3312199
cites work: Weak alternating automata are not that weak
cites work: Q4501665
cites work: Efficient minimization of deterministic weak \(\omega\)-automata
cites work: Borel determinacy
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Alternating finite automata on \(\omega\)-words
cites work: Q3753490
cites work: Alternating automata, the weak monadic theory of trees and its complexity
cites work: Alternating automata on infinite trees
cites work: Q5317419
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
cites work: Büchi Complementation Made Tight
cites work: Tighter Bounds for the Determinisation of Büchi Automata
cites work: Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
cites work: Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
cites work: Determinising Parity Automata
cites work: The complexity of propositional linear temporal logics
cites work: Finite-state \(\omega\)-languages
cites work: Q4055589
cites work: Propositional dynamic logic of looping and converse is elementarily decidable
cites work: Q4385530
cites work: The Büchi Complementation Saga
cites work: Reasoning about infinite computations
cites work: Q4158997
cites work: Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
full work available at URL: https://doi.org/10.4171/automata-1/6
OpenAlex ID: W4200240938
DOI: 10.4171/AUTOMATA-1/6
description: scientific article; zbMATH DE number 7469504