Minimization of automata for liveness languages
From MaRDI portal
(Redirected from Publication:6160912)
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
- A Hierarchy of Nondeterminism
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Decision problems forω-automata
- Efficient minimization of deterministic weak -automata
- Eventually safe languages
- Good for games automata: from nondeterminism to alternation
- scientific article; zbMATH DE number 1136080 (Why is no real title available?)
- Linear Automaton Transformations
- Minimal NFA Problems are Hard
- Minimizing GFG Transition-Based Automata
- Nondeterminism in the presence of a diverse or unknown future
- On Determinisation of Good-for-Games Automata
- On Repetition Languages
- Relating word and tree automata
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
Cited in
(3)
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)
