Translating to Co-Büchi Made Tight, Unified, and Useful
From MaRDI portal
Publication:2946678
DOI10.1145/2362355.2362357zbMath1351.68135OpenAlexW2095489261MaRDI QIDQ2946678
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2362355.2362357
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Fuzzy alternating Büchi automata over distributive lattices ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ The Quest for a Tight Translation of Büchi to co-Büchi Automata ⋮ On the Way to Alternating Weak Automata ⋮ Rabin vs. Streett Automata
This page was built for publication: Translating to Co-Büchi Made Tight, Unified, and Useful