Automata Minimization is a formal method in automata theory that systematically reduces a given finite automaton to its minimal equivalent, defined as the smallest deterministic finite automaton that recognizes the same regular language while preserving behavioral equivalence.
102
Publications
3.6K
Citations
169
Authors
113
Institutions
Publications per year
2017–2026
8
Publications
102
Tao Jiang, Bala Ravikumar · SIAM Journal on Computing · 1993 · 249 citations
Model minimization in Markov decision processes
Thomas Dean, Robert Givan · 1997 · 189 citations
Incremental Construction of Minimal Acyclic Finite-State Automata
Jan Daciuk, Stoyan Mihov, Bruce W. Watson et al. · Computational Linguistics · 2000 · 181 citations · Full text
1–5 of 102
Authors
169
- BW
5
h-index
- JD
4
h-index
- AM
4
h-index
- JH
3
h-index
- YL
3
h-index
1–5 of 169
Institutions
113
University of Pretoria
Pretoria, South Africa
4 h-index
4 publications
287 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
4 h-index
7 publications
88 citations
Shaanxi Normal University
Xi'an, China
4 h-index
7 publications
297 citations
Sun Yat-sen University
Guangzhou, China
3 h-index
7 publications
297 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
3 h-index
3 publications
71 citations
Institute of Mathematics and Informatics
Sofia, Bulgaria
3 h-index
4 publications
104 citations
Université de Bordeaux
Bordeaux, France
3 h-index
3 publications
71 citations
Umeå University
Umeå, Sweden
3 h-index
3 publications
74 citations
1–8 of 113
Venues
- Theoretical Computer Science
9 publications · 408 citations
9
h-index
- International Journal of Foundations of Computer Science
IJFCS · 6 publications · 162 citations
6
h-index
- Fuzzy Sets and Systems
4 publications · 240 citations
4
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 4 publications · 74 citations
4
h-index
- SIAM Journal on Computing
3 publications · 315 citations
3
h-index
1–5