Finite Automata

Finite Automata is a mathematical model of computation that consists of a finite set of states, a finite input alphabet, a transition function mapping state-input pairs to states, a designated initial state, and a set of accepting states, which collectively recognize regular languages by processing input strings sequentially and transitioning between states according to the transition function.

5K

Publications

298.5K

Citations

5.9K

Authors

1.7K

Institutions

Publications per year

2017–2026

424

Authors

5.9K

  1. MY
    Moshe Y. Vardi

    Rice University, United States

    37 publications · 5.9K citations

    24

    h-index

  2. DQ
    Daowen Qiu

    Sun Yat-sen University, China

    28 publications · 1.4K citations

    22

    h-index

  3. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    36 publications · 1.4K citations

    22

    h-index

  4. RA
    Rajeev Alur

    University of Pennsylvania, United States

    20 publications · 9.9K citations

    19

    h-index

  5. EF
    Enrico Formenti

    Université Côte d'Azur, France

    27 publications · 911 citations

    19

    h-index

1–5 of 5.9K

Venues

  1. Theoretical Computer Science

    393 publications · 27.5K citations

    67

    h-index

  2. Journal of Computer and System Sciences

    107 publications · 6.4K citations

    41

    h-index

  3. SIAM Journal on Computing

    55 publications · 4.2K citations

    37

    h-index

  4. Information and Computation

    114 publications · 4.7K citations

    37

    h-index

  5. Journal of the ACM

    JACM · 66 publications · 8.9K citations

    36

    h-index

1–5