Deternimization of Büchi Automata as Partitioned Automata

DOI10.1007/978-3-642-38768-5_16zbMATH Open1381.68136OpenAlexW88276592MaRDI QIDQ4925234

Mengfei Yang, Cong Tian, Zhenhua Duan

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_16

zbMATH Keywords

verificationBüchi automatasubset constructiondeterminizationpartitioned automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition ⋮ A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata

This page was built for publication: Deternimization of Büchi Automata as Partitioned Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925234)