Dfa Minimization
DFA Minimization is a computational method in automata theory that reduces a deterministic finite automaton to its minimal equivalent by merging indistinguishable states, resulting in a canonical, state-optimal representation.
36
Publications
1.9K
Citations
71
Authors
51
Institutions
Publications per year
2017–2026
2
Variants
Dfa Reduction
36
Tao Jiang, Bala Ravikumar · SIAM Journal on Computing · 1993 · 249 citations
Minimization of symbolic automata
Loris D’Antoni, Margus Veanes · 2014 · 94 citations
Learning DFA representations of HTTP for protecting web applications
Kenneth L. Ingham, Anil Somayaji, John Burge et al. · Computer Networks · 2006 · 93 citations
A taxonomy of finite automata minimization algorithms
BW Bruce Watson · TU/e Research Portal · 1993 · 59 citations · Full text
1–5 of 36
71
3 publications · 50 citations
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 71
51
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
110 citations
University of Rhode Island
Kingston, United States
2 h-index
3 publications
283 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
2 publications
45 citations

Rice University
Houston, United States
2 h-index
6 publications
135 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
2 publications
110 citations

Philadelphia University
Philadelphia, United States
2 h-index
2 publications
110 citations
University of Stuttgart
Stuttgart, Germany
1 h-index
2 publications
24 citations
University of Southern California
Los Angeles, United States
1 h-index
3 publications
72 citations
1–8 of 51
4 publications · 720 citations
4
h-index
IJFCS · 3 publications · 59 citations
3
h-index
2 publications · 31 citations
2
h-index
Repository · 2 publications · 48 citations
2
h-index
1 publications · 31 citations
1
h-index
1–5