Decidability Problems

Decidability Problems is a theoretical construct in the study of Context-Free Languages that identifies decision questions about language properties for which an algorithm can definitively determine the truth or falsity of a given instance.

776

Publications

32.9K

Citations

1K

Authors

486

Institutions

Publications per year

2017–2026

64

Authors

1K

  1. MY
    Moshe Y. Vardi

    Rice University, United States

    9 publications · 649 citations

    9

    h-index

  2. SD
    Stéphane Demri

    Centre National de la Recherche Scientifique, France

    8 publications · 208 citations

    8

    h-index

  3. AP
    Alberto Policriti

    University of Udine, Italy

    6 publications · 132 citations

    6

    h-index

  4. SD
    Stéphanie Delaune

    Centre National de la Recherche Scientifique, France

    6 publications · 166 citations

    6

    h-index

  5. TP
    Thomas Place

    Laboratoire Bordelais de Recherche en Informatique, France

    6 publications · 122 citations

    6

    h-index

1–5 of 1K

Venues

  1. Theoretical Computer Science

    53 publications · 1.8K citations

    23

    h-index

  2. Journal of Symbolic Logic

    37 publications · 2.2K citations

    22

    h-index

  3. Information and Computation

    17 publications · 524 citations

    15

    h-index

  4. Journal of the ACM

    JACM · 19 publications · 1.2K citations

    14

    h-index

  5. Journal of Computer and System Sciences

    17 publications · 1.1K citations

    14

    h-index

1–5