Affine Parikh automata
RAIRO-Theor. Inf. Appl., 46 4 (2012) 511-545
Published online: 2012-08-02
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Parikh one-counter automata
Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez and Ritam RahaInformation and Computation 306 105322 (2025)
https://doi.org/10.1016/j.ic.2025.105322
Jumping Automata over Infinite Words
Shaull Almagor and Omer YizhaqTheory of Computing Systems 68 (6) 1572 (2024)
https://doi.org/10.1007/s00224-024-10192-w
Jumping Automata Must Pay
Shaull Almagor and Ishai SalgadoElectronic Proceedings in Theoretical Computer Science 409 19 (2024)
https://doi.org/10.4204/EPTCS.409.6
Foundations of Software Science and Computation Structures
Pascal Baumann, Flavio D’Alessandro, Moses Ganardi, et al.Lecture Notes in Computer Science, Foundations of Software Science and Computation Structures 13992 240 (2023)
https://doi.org/10.1007/978-3-031-30829-1_12
Developments in Language Theory
Stefan HoffmannLecture Notes in Computer Science, Developments in Language Theory 13911 113 (2023)
https://doi.org/10.1007/978-3-031-33264-7_10
Developments in Language Theory
Shaull Almagor and Omer YizhaqLecture Notes in Computer Science, Developments in Language Theory 13911 9 (2023)
https://doi.org/10.1007/978-3-031-33264-7_2
Foundations of Software Science and Computation Structures
Bartosz Bednarczyk and Jakub MichaliszynLecture Notes in Computer Science, Foundations of Software Science and Computation Structures 12650 82 (2021)
https://doi.org/10.1007/978-3-030-71995-1_5
224 (2020)
https://doi.org/10.1145/3373718.3394741
341 (2020)
https://doi.org/10.1145/3373718.3394776
The Algebraic Theory of Parikh Automata
Michaël Cadilhac, Andreas Krebs and Pierre McKenzieTheory of Computing Systems 62 (5) 1241 (2018)
https://doi.org/10.1007/s00224-017-9817-2
Reversibility and Universality
Oscar H. Ibarra and Ian McQuillanEmergence, Complexity and Computation, Reversibility and Universality 30 357 (2018)
https://doi.org/10.1007/978-3-319-73216-9_17
1 (2017)
https://doi.org/10.1109/LICS.2017.8005141
10329 175 (2017)
https://doi.org/10.1007/978-3-319-60134-2_15
On a class of languages with holonomic generating functions
Giusi Castiglione and Paolo MassazzaTheoretical Computer Science 658 74 (2017)
https://doi.org/10.1016/j.tcs.2016.07.022
The effect of end-markers on counter machines and commutativity
Oscar H. Ibarra and Ian McQuillanTheoretical Computer Science 627 71 (2016)
https://doi.org/10.1016/j.tcs.2016.02.034
329 (2015)
https://doi.org/10.1109/LICS.2015.39
Descriptional Complexity of Formal Systems
Oscar H. IbarraLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 8614 5 (2014)
https://doi.org/10.1007/978-3-319-09704-6_2
Algebraic Informatics
Michaël Cadilhac, Andreas Krebs and Pierre McKenzieLecture Notes in Computer Science, Algebraic Informatics 8080 60 (2013)
https://doi.org/10.1007/978-3-642-40663-8_7