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

Authors

45

  1. PM
    Pierre McKenzie

    Université de Montréal, Canada

    3 publications · 50 citations

    3

    h-index

  2. MC
    Michaël Cadilhac

    Université de Montréal, Canada

    3 publications · 50 citations

    3

    h-index

  3. AA
    Adrian Atanasiu

    University of Bucharest, Romania

    2 publications · 73 citations

    2

    h-index

  4. WC
    Wen Chean Teh

    Universiti Sains Malaysia, Malaysia

    2 publications · 39 citations

    2

    h-index

  5. AF
    Alain Finkel

    École Normale Supérieure Paris-Saclay, France

    2 publications · 40 citations

    2

    h-index

1–5 of 45

Venues

  1. International Journal of Foundations of Computer Science

    IJFCS · 4 publications · 148 citations

    4

    h-index

  2. Theoretical Computer Science

    3 publications · 98 citations

    3

    h-index

  3. Journal of Computer and System Sciences

    2 publications · 101 citations

    2

    h-index

  4. Annals of Pure and Applied Logic

    1 publications · 36 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 10 citations

    1

    h-index

1–5