Parity Automata

Parity Automata is a type of infinite-word automaton in automata theory that extends finite automata with a parity acceptance condition, where the priority function assigns natural numbers to states and a run is accepting if the highest priority occurring infinitely often is even.

22

Publications

1.1K

Citations

37

Authors

32

Institutions

Publications per year

2017–2026

5

Authors

37

  1. TW
    Thomas Wilke

    Justus-Liebig-Universität Gießen, Germany

    2 publications · 235 citations

    2

    h-index

  2. PM
    Paul-André Melliès

    Université Paris Cité, France

    2 publications · 23 citations

    2

    h-index

  3. NF
    Nathanaël Fijalkow

    Laboratoire Bordelais de Recherche en Informatique, France

    2 publications · 50 citations

    2

    h-index

  4. PP
    Pedro P. B. de Oliveira

    Universidade Presbiteriana Mackenzie, Brazil

    2 publications · 42 citations

    2

    h-index

  5. CG
    Charles Grellois

    University of Bologna, Italy

    2 publications · 23 citations

    2

    h-index

1–5 of 37

Venues

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

    Repository · 2 publications · 44 citations

    2

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 56 citations

    2

    h-index

  3. RAIRO - Theoretical Informatics and Applications

    ITA · 2 publications · 115 citations

    2

    h-index

  4. Natural Computing

    1 publications · 29 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 13 citations

    1

    h-index

1–5