Emptiness Problem

The Emptiness Problem is the formal decision problem of determining whether a given regular language, represented by a finite automaton, regular expression, or equivalent formalism, accepts no strings, thereby distinguishing it from other decision problems by its focus on language emptiness.

226

Publications

10.2K

Citations

337

Authors

223

Institutions

Publications per year

2017–2026

23

Authors

337

  1. PJ
    Peter J. Brockwell

    Colorado State University, United States

    4 publications · 53 citations

    4

    h-index

  2. MY
    Moshe Y. Vardi

    Rice University, United States

    4 publications · 283 citations

    4

    h-index

  3. JE
    Javier Esparza

    Technical University of Munich, Germany

    4 publications · 224 citations

    4

    h-index

  4. TT
    Tayssir Touili

    Université Paris Cité, France

    3 publications · 202 citations

    4

    h-index

  5. MS
    Masahiro Shiroishi

    The University of Tokyo, Japan

    3 publications · 98 citations

    3

    h-index

1–5 of 337

Venues

  1. Journal of Applied Probability

    JAP · 10 publications · 221 citations

    10

    h-index

  2. Logical Methods in Computer Science

    LMCS · 6 publications · 168 citations

    6

    h-index

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

    Repository · 5 publications · 96 citations

    5

    h-index

  4. Journal of Physics A Mathematical and General

    5 publications · 282 citations

    5

    h-index

  5. ACM Transactions on Computational Logic

    TOCL · 5 publications · 147 citations

    5

    h-index

1–5