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
Parents
22
1–5 of 22
37
2
h-index
2
h-index
Laboratoire Bordelais de Recherche en Informatique, France
2 publications · 50 citations
2
h-index
2
h-index
2
h-index
1–5 of 37
32
Laboratoire Bordelais de Recherche en Informatique
Talence, France
3 h-index
3 publications
143 citations
Université Paris Cité
Paris, France
3 h-index
5 publications
76 citations
Université de Bordeaux
Bordeaux, France
3 h-index
3 publications
143 citations

University of Warsaw
Warsaw, Poland
3 h-index
6 publications
118 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
3 h-index
3 publications
143 citations

Universidade Presbiteriana Mackenzie
São Paulo, Brazil
2 h-index
3 publications
55 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
113 citations

Rice University
Houston, United States
2 h-index
2 publications
264 citations
1–8 of 32
Repository · 2 publications · 44 citations
2
h-index
ENTCS · 2 publications · 56 citations
2
h-index
ITA · 2 publications · 115 citations
2
h-index
1 publications · 29 citations
1
h-index
Repository · 1 publications · 13 citations
1
h-index
1–5