Parikh Automata
Parikh Automaton is a finite-state automaton extended with counters that are incremented along transitions and constrained by a semi-linear set of allowed final values, thereby recognizing languages based on the Parikh image of input words.
20
Publications
637
Citations
45
Authors
35
Institutions
Publications per year
2017–2026
1
Variants
Parikh Automaton
Parents
20
Parikh matrices and amiable words
Adrian Atanasiu, Radu Atanasiu, Ion Petre · Theoretical Computer Science · 2007 · 59 citations
Efficient text fingerprinting via Parikh mapping
Amihood Amir, Alberto Apostolico, Gad M. Landau et al. · Journal of Discrete Algorithms · 2003 · 55 citations · Full text
Parikhʼs theorem: A simple and direct automaton construction
Javier Esparza, Pierre Ganty, Stefan Kiefer et al. · Information Processing Letters · 2011 · 52 citations · Full text
1–5 of 20
45
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 45
35

University of Bucharest
Bucharest, Romania
3 h-index
4 publications
217 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
62 citations
University of Oxford
Oxford, United Kingdom
2 h-index
3 publications
108 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
2 h-index
2 publications
40 citations

Universiti Sains Malaysia
George Town, Malaysia
2 h-index
3 publications
53 citations
Université de Montréal
Montreal, Canada
2 h-index
4 publications
80 citations

University of Milan
Milan, Italy
2 h-index
4 publications
78 citations

University of Turku
Turku, Finland
2 h-index
2 publications
26 citations
1–8 of 35
IJFCS · 4 publications · 148 citations
4
h-index
3 publications · 98 citations
3
h-index
2 publications · 101 citations
2
h-index
1 publications · 36 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1–5