On the minimization problem for -automata
From MaRDI portal
Publication:5096909
Recommendations
Cites work
- 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?)
- Finite-state \(\omega\)-languages
- SEMIGROUPS WITH IDEMPOTENT STABILIZERS AND APPLICATIONS TO AUTOMATA THEORY
- Saturating right congruences
- Testing and generating infinite sequences by a finite automaton
Cited in
(14)- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Efficient minimization of deterministic weak -automata
- A maxmin problem on finite automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- Factorizations and universal automaton of omega languages
- Factorizations and universal automaton of omega languages
- Surminimisation of automata
- Formal Modeling and Analysis of Timed Systems
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Efficient algorithms for morphisms over omega-regular languages
- SAT-based minimization of deterministic \(\omega \)-automata
- Translation of semi-extended regular expressions using derivatives
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)
