Alternation Removal in Büchi Automata

DOI10.1007/978-3-642-14162-1_7zbMath1288.68148OpenAlexW2034718467MaRDI QIDQ3587428

Adin Rosenberg, Orna Kupferman, Udi Boker

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Efficient approach of translating LTL formulae into Büchi automata ⋮ Automata Theory and Model Checking ⋮ Degeneralization algorithm for generation of Büchi automata based on contented situation ⋮ HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems ⋮ Unnamed Item ⋮ The Quest for a Tight Translation of Büchi to co-Büchi Automata ⋮ Rabin vs. Streett Automata

This page was built for publication: Alternation Removal in Büchi Automata