Minimization of automata for liveness languages

DOI10.1007/978-3-031-19992-9_12zbMath1522.68259OpenAlexW4312904347MaRDI QIDQ6160912

Bader abu Radi, Orna Kupferman

Publication date: 2 June 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19992-9_12

zbMATH Keywords

complexitylivenessminimizationBüchi automataautomata on infinite wordsgood-for-games automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient minimization of deterministic weak \(\omega\)-automata
• Eventually safe languages
• Relating word and tree automata
• Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
• Linear Automaton Transformations
• On Determinisation of Good-for-Games Automata
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Minimal NFA Problems are Hard
• On Repetition Languages
• Minimizing GFG Transition-Based Automata
• Nondeterminism in the Presence of a Diverse or Unknown Future
• Decision problems forω-automata
• A Hierarchy of Nondeterminism

This page was built for publication: Minimization of automata for liveness languages