Automata Theory

Automata Theory is a branch of theoretical computer science that studies abstract computational devices and the class of problems they can solve, distinguished by its focus on formal models of computation such as finite automata, pushdown automata, and Turing machines within the framework of formal languages and computational complexity.

6.3K

Publications

371.8K

Citations

7.6K

Authors

2K

Institutions

Publications per year

2017–2026

553

Authors

7.6K

  1. MY
    Moshe Y. Vardi

    Rice University, United States

    42 publications · 6.2K citations

    28

    h-index

  2. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    32 publications · 10K citations

    26

    h-index

  3. KG
    Kim G. Larsen

    Aalborg University, Denmark

    46 publications · 2.4K citations

    25

    h-index

  4. DQ
    Daowen Qiu

    Sun Yat-sen University, China

    29 publications · 1.4K citations

    23

    h-index

  5. RA
    Rajeev Alur

    University of Pennsylvania, United States

    24 publications · 11.7K citations

    22

    h-index

1–5 of 7.6K

Venues

  1. Theoretical Computer Science

    415 publications · 29.6K citations

    67

    h-index

  2. Journal of Computer and System Sciences

    118 publications · 6.9K citations

    46

    h-index

  3. Physica D Nonlinear Phenomena

    79 publications · 9.2K citations

    44

    h-index

  4. Journal of the ACM

    JACM · 77 publications · 10.5K citations

    39

    h-index

  5. SIAM Journal on Computing

    65 publications · 4.8K citations

    37

    h-index

1–5