On the Way to Alternating Weak Automata
From MaRDI portal
Publication:5090957
DOI10.4230/LIPICS.FSTTCS.2018.21OpenAlexW2907557140MaRDI QIDQ5090957FDOQ5090957
Authors: Udi Boker, Karoliina Lehtinen 
Publication date: 21 July 2022
Full work available at URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2018.html#BokerL18
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Solving parity games using an automata-based algorithm
- A gap property of deterministic tree languages.
- Testing and generating infinite sequences by a finite automaton
- Weak alternating automata are not that weak
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Translating to co-Büchi made tight, unified, and useful
- The modal mu-calculus alternation hierarchy is strict
- On alternating \(\omega\)-automata
- Succinct progress measures for solving parity games
- Hierarchies of weak automata and weak monadic formulas
- Deciding the topological complexity of Büchi languages
- Alternating Tree Automata and Parity Games
- Deciding parity games in quasipolynomial time
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- Deciding the weak definability of Büchi definable tree languages
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Title not available (Why is that?)
- Automaton-Based Criteria for Membership in CTL
Cited In (14)
- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Quasi-weak cost automata: a new variant of weakness
- Verification, Model Checking, and Abstract Interpretation
- Weak alternating timed automata
- Mathematical Foundations of Computer Science 2003
- Alternating Weighted Automata
- Quasipolynomial computation of nested fixpoints
- Title not available (Why is that?)
- Weak equivalence of higher-dimensional automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the power of alternation in automata theory
- On input read-modes of alternating Turing machines
This page was built for publication: On the Way to Alternating Weak Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090957)
