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

Authors

71

  1. AV
    Antti Valmari

    3 publications · 50 citations

    3

    h-index

  2. MY
    Moshe Y. Vardi

    Rice University, United States

    2 publications · 45 citations

    2

    h-index

  3. MV
    Margus Veanes

    Microsoft (United States), United States

    2 publications · 110 citations

    2

    h-index

  4. LM
    Lucas M. Tabajara

    Rice University, United States

    2 publications · 45 citations

    2

    h-index

  5. SB
    Suguman Bansal

    Rice University, United States

    2 publications · 45 citations

    2

    h-index

1–5 of 71

Venues

  1. 4

    h-index

  2. International Journal of Foundations of Computer Science

    IJFCS · 3 publications · 59 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 31 citations

    2

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 48 citations

    2

    h-index

  5. Waterbirds

    1 publications · 31 citations

    1

    h-index

1–5