State Complexity

State Complexity is the minimum number of states required by a deterministic finite automaton to recognize a given regular language, serving as a measure of the inherent structural complexity of the language within the theory of finite automata.

250

Publications

12K

Citations

357

Authors

236

Institutions

Publications per year

2017–2026

35

Authors

357

  1. SY
    Sheng Yü

    Western University, Canada

    20 publications · 1.3K citations

    18

    h-index

  2. KS
    Kai Salomaa

    Queen's University, Canada

    26 publications · 1.1K citations

    16

    h-index

  3. GJ
    Galina Jirásková

    Slovak Academy of Sciences, Slovakia

    14 publications · 433 citations

    12

    h-index

  4. AO
    Alexander Okhotin

    University of Turku, Finland

    8 publications · 221 citations

    8

    h-index

  5. MD
    Michael Domaratzki

    University of Manitoba, Canada

    8 publications · 194 citations

    8

    h-index

1–5 of 357

Venues

  1. Theoretical Computer Science

    28 publications · 1.5K citations

    19

    h-index

  2. International Journal of Foundations of Computer Science

    IJFCS · 22 publications · 813 citations

    16

    h-index

  3. IEEE Transactions on Information Theory

    12 publications · 759 citations

    12

    h-index

  4. Fundamenta Informaticae

    10 publications · 263 citations

    10

    h-index

  5. Justus-Liebig-Universität Gießen

    Repository · 7 publications · 204 citations

    7

    h-index

1–5