scientific article; zbMATH DE number 1500643
From MaRDI portal
Publication:4501665
Recommendations
- Tighter Bounds for the Determinisation of Büchi Automata
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- scientific article; zbMATH DE number 4179361
- Structural complexity of \(\omega\)-automata
Cited in
(23)- scientific article; zbMATH DE number 7770050 (Why is no real title available?)
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- Observations on determinization of Büchi automata
- On Repetition Languages
- Structural complexity of \(\omega\)-automata
- \(\omega \)-automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Practical applications of the alternating cycle decomposition
- Zielonka DAG acceptance and regular languages over infinite words
- A theory of ultimately periodic languages and automata with an application to time granularity
- A tighter analysis of Piterman's Büchi determinization
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
- Rabin vs. Streett automata
- An impossibility result in automata-theoretic reinforcement learning
- Multi-Valued Reasoning about Reactive Systems
- Index appearance record with preorders
- Modular mix-and-match complementation of Büchi automata
- On the translation of automata to linear temporal logic
- Stochastic games with lexicographic objectives
- Index appearance record for transforming Rabin automata into parity automata
- Automata theory and model checking
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501665)
