Finite-state Machines

Finite-State Machine is a mathematical model of computation that consists of a finite number of states, transitions between those states, and actions defined by inputs, distinguished from other automata by its restriction to a limited set of discrete states and deterministic or nondeterministic state transitions.

5K

Publications

312.7K

Citations

6.4K

Authors

1.7K

Institutions

Publications per year

2017–2026

466

Authors

6.4K

  1. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    36 publications · 1.5K citations

    21

    h-index

  2. RM
    Robert M. Hierons

    Brunel University of London, United Kingdom

    31 publications · 1.1K citations

    21

    h-index

  3. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    28 publications · 7.9K citations

    20

    h-index

  4. KM
    Kenichi Morita

    Hiroshima University, Japan

    21 publications · 994 citations

    19

    h-index

  5. CN
    Christoforos N. Hadjicostis

    University of Cyprus, Cyprus

    25 publications · 1.1K citations

    19

    h-index

1–5 of 6.4K

Venues

  1. Theoretical Computer Science

    302 publications · 22.9K citations

    61

    h-index

  2. IEEE Transactions on Automatic Control

    134 publications · 7.8K citations

    51

    h-index

  3. Journal of Computer and System Sciences

    98 publications · 6.6K citations

    43

    h-index

  4. Information and Computation

    98 publications · 8.3K citations

    35

    h-index

  5. Journal of the ACM

    JACM · 57 publications · 7.5K citations

    35

    h-index

1–5