References

  1. Antonio Abu Nassar & Shaull Almagor (2022): Simulation by Rounds of Letter-To-Letter Transducers. In: 30th EACSL Annual Conference on Computer Science Logic, doi:10.4230/LIPIcs.CSL.2022.3.
  2. Shaull Almagor (2020): Process Symmetry in Probabilistic Transducers. In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, doi:10.4230/LIPIcs.FSTTCS.2020.35.
  3. Shaull Almagor & Orna Kupferman (2011): Max and sum semantics for alternating weighted automata. In: International Symposium on Automated Technology for Verification and Analysis. Springer, pp. 13–27, doi:10.1007/978-3-642-24372-1_2.
  4. Shaull Almagor & Omer Yizhaq (2023): Jumping Automata over Infinite Words. In: International Conference on Developments in Language Theory. Springer, pp. 9–22, doi:10.1007/978-3-031-33264-7_2.
  5. Udi Boker (2021): Quantitative vs. weighted automata. In: Reachability Problems: 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings 15. Springer, pp. 3–18, doi:10.1007/978-3-030-89716-1_1.
  6. Michaël Cadilhac, Alain Finkel & Pierre McKenzie (2012): Affine Parikh automata. RAIRO-Theoretical Informatics and Applications 46(4), pp. 511–545, doi:10.1051/ita/2012013.
  7. Michaël Cadilhac, Alain Finkel & Pierre McKenzie (2012): Bounded parikh automata. International Journal of Foundations of Computer Science 23(08), pp. 1691–1709, doi:10.1142/S0129054112400709.
  8. Krishnendu Chatterjee, Laurent Doyen & Thomas A Henzinger (2010): Quantitative languages. ACM Transactions on Computational Logic (TOCL) 11(4), pp. 1–38, doi:10.1007/978-3-540-87531-4_28.
  9. Manfred Droste, Werner Kuich & Heiko Vogler (2009): Handbook of weighted automata. Springer Science & Business Media, doi:10.1007/978-3-642-01492-5.
  10. Szilárd Zsolt Fazekas, Kaito Hoshi & Akihiro Yamamura (2021): Two-way deterministic automata with jumping mode. Theoretical Computer Science 864, pp. 92–102, doi:10.1016/j.tcs.2021.02.030.
  11. Henning Fernau, Meenakshi Paramasivan & Markus L Schmid (2015): Jumping finite automata: characterizations and complexity. In: International Conference on Implementation and Application of Automata. Springer, pp. 89–101, doi:10.1007/978-3-319-22360-5_8.
  12. Henning Fernau, Meenakshi Paramasivan, Markus L Schmid & Vojtěch Vorel (2017): Characterization and complexity results on jumping finite automata. Theoretical Computer Science 679, pp. 31–52, doi:10.1016/j.tcs.2016.07.006.
  13. Dana Fisman, Joshua Grogin & Gera Weiss (2023): A Normalized Edit Distance on Infinite Words. In: 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, doi:10.4230/LIPIcs.CSL.2023.20.
  14. Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen & Martin Zimmermann (2022): Parikh Automata over Infinite Words. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, doi:10.4230/LIPIcs.FSTTCS.2022.40.
  15. Kosaburo Hashiguchi (1982): Limitedness theorem on finite automata with distance functions. Journal of computer and system sciences 24(2), pp. 233–244, doi:10.1016/0022-0000(82)90051-4.
  16. Felix Klaedtke & Harald Rueß (2003): Monadic second-order logics with cardinalities. In: Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30–July 4, 2003 Proceedings 30. Springer, pp. 681–696, doi:10.1007/3-540-45061-0_54.
  17. Giovanna J Lavado, Giovanni Pighizzini & Shinnosuke Seki (2014): Operational state complexity under Parikh equivalence. In: Descriptional Complexity of Formal Systems: 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings 16. Springer, pp. 294–305, doi:10.1007/978-3-319-09704-6_26.
  18. Hing Leung & Viktor Podolskiy (2004): The limitedness problem on distance automata: Hashiguchi's method revisited. Theoretical Computer Science 310(1-3), pp. 147–158, doi:10.1016/S0304-3975(03)00377-3.
  19. Alexander Meduna & Petr Zemek (2012): Jumping finite automata. International Journal of Foundations of Computer Science 23(07), pp. 1555–1578, doi:10.1142/S0129054112500244.
  20. Mehryar Mohri (2002): Edit-distance of weighted automata. In: International Conference on Implementation and Application of Automata. Springer, pp. 1–23, doi:10.1007/3-540-44977-9_1.
  21. Vojtěch Vorel (2018): On basic properties of jumping finite automata. International Journal of Foundations of Computer Science 29(01), pp. 1–15, doi:10.1142/S0129054118500016.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org