Concepedia

Alternating Automata

Alternating Automata is a finite automaton that extends nondeterministic automata by allowing existential and universal branching modes in its transitions, thereby enabling states to split into multiple concurrent computations whose acceptance is determined by Boolean combinations of successor states.

77

Publications

5.5K

Citations

121

Authors

88

Institutions

Publications per year

2017–2026

4

Parents

Publications

77

Alternation

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text

, , +17

LTL with the freeze quantifier and register automata

Stéphane Demri, Ranko Lazić · ACM Transactions on Computational Logic · 2009 · 255 citations · Full text

, , +16

Alternating automata on infinite trees

David E. Muller, Paul E. Schupp · Theoretical Computer Science · 1987 · 242 citations

, , +8

Safraless Decision Procedures

Orna Kupferman, Moshe Y. Vardi · 2005 · 238 citations

, , +14

Alternating finite automata on ω-words

Satoru Miyano, Takeshi Hayashi · Theoretical Computer Science · 1984 · 228 citations

, , +7

1–5 of 77

Authors

121

  1. MY
    Moshe Y. Vardi

    Rice University, United States

    7 publications · 871 citations

    7

    h-index

  2. OK
    Orna Kupferman

    Hebrew University of Jerusalem, Israel

    5 publications · 705 citations

    5

    h-index

  3. PE
    Paul E. Schupp

    University of Illinois Urbana-Champaign, United States

    5 publications · 647 citations

    5

    h-index

  4. DE
    David E. Muller

    University of Illinois Urbana-Champaign, United States

    4 publications · 610 citations

    4

    h-index

  5. RL
    Ranko Lazić

    University of Warwick, United Kingdom

    4 publications · 348 citations

    4

    h-index

1–5 of 121

Institutions

88

  1. Rice University

    Houston, United States

    7 h-index

    8 publications

    755 citations

  2. Université Paris Cité

    Paris, France

    6 h-index

    8 publications

    482 citations

  3. University of Illinois System

    Urbana, United States

    4 h-index

    7 publications

    978 citations

  4. École Normale Supérieure Paris-Saclay

    Gif-sur-Yvette, France

    4 h-index

    4 publications

    354 citations

  5. University of Warwick

    Coventry, United Kingdom

    4 h-index

    5 publications

    377 citations

  6. Comenius University Bratislava

    Bratislava, Slovakia

    4 h-index

    7 publications

    123 citations

  7. Hebrew University of Jerusalem

    Jerusalem, Israel

    3 h-index

    3 publications

    615 citations

  8. Centre National de la Recherche Scientifique

    Paris, France

    3 h-index

    3 publications

    316 citations

1–8 of 88

Venues

  1. Theoretical Computer Science

    10 publications · 852 citations

    10

    h-index

  2. Logical Methods in Computer Science

    LMCS · 5 publications · 139 citations

    5

    h-index

  3. ACM Transactions on Computational Logic

    TOCL · 5 publications · 600 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 1.3K citations

    3

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 56 citations

    3

    h-index

1–5