References

  1. Michaël Cadilhac, Alain Finkel & Pierre McKenzie (2011): On the Expressiveness of Parikh Automata and Related Models. In: Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto & Beatrice Palano: Third Workshop on Non-Classical Models for Automata and Applications (NCMA 2011), books@ocg.at 282. Austrian Computer Society, pp. 103–119.
  2. Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez & Ritam Raha (2023): Parikh One-Counter Automata. In: Jérôme Leroux, Sylvain Lombardy & David Peleg: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), LIPIcs 272. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 30:1–30:15, doi:10.4230/LIPIcs.MFCS.2023.30.
  3. Jean-Baptiste Courtois & Sylvain Schmitz (2014): Alternating Vector Addition Systems with States. In: Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger & Zoltán Ésik: Mathematical Foundations of Computer Science 2014, LNCS 8634. Springer, pp. 220–231, doi:10.1007/978-3-662-44522-8_19.
  4. Akio Fujiyoshi & Takumi Kasai (2000): Spinal-Formed Context-Free Tree Grammars. Theory Comput. Syst. 33(1), pp. 59–83, doi:10.1007/S002249910004.
  5. Seymour Ginsburg & Edwin Spanier (1966): Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16(2), pp. 285–296, doi:10.2140/pjm.1966.16.285.
  6. Mario Grobler, Leif Sabellek & Sebastian Siebertz (2024): Remarks on Parikh-Recognizable Omega-languages. In: Aniello Murano & Alexandra Silva: 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), LIPIcs 288. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 31:1–31:21, doi:10.4230/LIPIcs.CSL.2024.31.
  7. I. Guessarian (1981): On pushdown tree automata. In: G. Goos, J. Hartmanis, W. Brauer, P. Brinch Hansen, D. Gries, C. Moler, G. Seegmüller, J. Stoer, N. Wirth, Egidio Astesiano & Corrado Böhm: CAAP '81 112. Springer, pp. 211–223, doi:10.1007/3-540-10828-9_64.
  8. Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen & Martin Zimmermann (2022): Parikh Automata over Infinite Words. In: Anuj Dawar & Venkatesan Guruswami: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022), LIPIcs 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 40:1–40:20, doi:10.4230/LIPICS.FSTTCS.2022.40.
  9. Christoph Haase & Simon Halfon (2014): Integer Vector Addition Systems with States. In: Joël Ouaknine, Igor Potapov & James Worrell: Reachability Problems. Springer, pp. 112–124, doi:10.1007/978-3-319-11439-2_9.
  10. Luisa Herrmann (2021): Linear weighted tree automata with storage and inverse linear tree homomorphisms. Information and Computation 281, pp. 104816, doi:10.1016/j.ic.2021.104816.
  11. Luisa Herrmann, Vincent Peth & Sebastian Rudolph (2024): Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures. In: Aniello Murano & Alexandra Silva: 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), LIPIcs 288. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 33:1–33:19, doi:10.4230/LIPICS.CSL.2024.33.
  12. John Hopcroft, Rajeev Motwani & Jeffrey Ullmann (2000): Introduction to Automata Theory, Languages, and Computation, 2 edition. Addison-Wesley.
  13. Felix Klaedtke (2004): Automata-based decision procedures for weak arithmetics. University of Freiburg. Available at http://freidok.ub.uni-freiburg.de/volltexte/1439/index.html.
  14. Felix Klaedtke & Harald Rueß (2002): Parikh automata and monadic second-order logics with linear cardinality constraints. Technical Report 177. Albert-Ludwigs-Universität Freiburg. (revised version).
  15. Felix Klaedtke & Harald Rueß (2003): Monadic Second-Order Logics with Cardinalities. In: Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow & Gerhard J. Woeginger: Automata, Languages and Programming, 30th International Colloquium (ICALP 2003), LNCS 2719. Springer, pp. 681–696, doi:10.1007/3-540-45061-0_54.
  16. Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar (1992): Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56(1), pp. 239–311, doi:10.1016/0168-0072(92)90075-B.
  17. Marvin L. Minsky (1967): Computation: finite and infinite machines. Prentice-Hall, Inc..
  18. J. W. Thatcher & J. B. Wright (1968): Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical systems theory 2, pp. 57–81, doi:10.1007/BF01691346.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org