Minimization of automata for liveness languages
From MaRDI portal
Publication:6160912
DOI10.1007/978-3-031-19992-9_12zbMATH Open1522.68259OpenAlexW4312904347MaRDI QIDQ6160912FDOQ6160912
Authors: 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
Recommendations
- Minimization of lattice automata
- Minimisation of automata
- Minimizing deterministic lattice automata
- Minimizing deterministic lattice automata
- Minimization of symbolic automata
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- scientific article; zbMATH DE number 7199591
- scientific article; zbMATH DE number 6917169
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- scientific article; zbMATH DE number 4108165
Cites Work
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Minimal NFA Problems are Hard
- Decision problems forω-automata
- Solving Games Without Determinization
- Linear Automaton Transformations
- Efficient minimization of deterministic weak \(\omega\)-automata
- A Hierarchy of Nondeterminism
- Title not available (Why is that?)
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Eventually safe languages
- Relating word and tree automata
- Title not available (Why is that?)
- On Determinisation of Good-for-Games Automata
- Nondeterminism in the presence of a diverse or unknown future
- Minimizing GFG Transition-Based Automata
- On Repetition Languages
This page was built for publication: Minimization of automata for liveness languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160912)
