On the minimization problem for -automata
From MaRDI portal
(Redirected from On the minimization problem for -automata)
On the minimization problem for \(\omega \)-automata
On the minimization problem for \(\omega \)-automata
Recommendations
Cites work
- Finite-state \(\omega\)-languages
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 512864 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- Saturating right congruences
- SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY
- Testing and generating infinite sequences by a finite automaton
Cited in
(16)- A maxmin problem on finite automata
- Efficient minimization of deterministic weak -automata
- scientific article; zbMATH DE number 4201643 (Why is no real title available?)
- Surminimisation of automata
- SAT-based minimization of deterministic -automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Factorizations and universal automaton of omega languages
- Efficient algorithms for morphisms over omega-regular languages
- Factorizations and universal automaton of omega languages
- Formal Modeling and Analysis of Timed Systems
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Translation of semi-extended regular expressions using derivatives
- Translation of semi-extended regular expressions using linear forms
This page was built for publication: On the minimization problem for \(\omega \)-automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096909)
