References

  1. Symeon Bozapalidis & Antonios Kalampakas (2008): Graph automata. Theoretical Computer Science 393(1-3), pp. 147–165, doi:10.1016/j.tcs.2007.11.022.
  2. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison & M. Tommasi (2007): Tree Automata — Techniques and Applications.
  3. Carles Creus, Adrià Gascón, Guillem Godoy & Lander Ramos (2012): The HOM problem is EXPTIME-complete. In: Proc.\@m 27th Annual IEEE Symp.\@m Logic in Computer Science. IEEE, pp. 255–264, doi:10.1109/LICS.2012.36.
  4. Leonard E. Dickson (1913): Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer.\@m J.\@m Math. 35(4), pp. 413–422, doi:10.2307/2370405.
  5. John Doner (1970): Tree acceptors and some of their applications. J.\@m Comput.\@m System Sci. 4(5), pp. 406–451, doi:10.1016/S0022-0000(70)80041-1.
  6. Frank Drewes (2006): Grammatical picture generation. Springer.
  7. Manfred Droste & Doreen Heusel (2015): The supports of weighted unranked tree automata. Funda.\@m Inform. 136(1–2), pp. 37–58, doi:10.3233/FI-2015-1143.
  8. Manfred Droste & Dietrich Kuske (2021): Weighted automata..
  9. Zoltán Fülöp & Heiko Vogler (2009): Weighted tree automata and tree transducers. In: Handbook of Weighted Automata, chapter 9. Springer, pp. 313–403, doi:10.1007/978-3-642-01492-5_9.
  10. Ferenc Gécseg & Magnus Steinby (2015): Tree Automata. Technical Report 1509.06233. arXiv.
  11. Dora Giammarresi & Antonio Restivo (1992): Recognizable picture languages. International Journal of Pattern Recognition and Artificial Intelligence 6(02n03), pp. 241–256, doi:10.1142/S021800149200014X.
  12. Guillem Godoy & Omer Giménez (2013): The HOM problem is decidable. J.\@m ACM 60(4), pp. 1–44, doi:10.1145/2508028.2501600.
  13. Guillem Godoy, Omer Giménez, Lander Ramos & Carme Àlvarez (2010): The HOM problem is decidable. In: Proc.\@m 42nd ACM symp.\@m Theory of Computing. ACM, pp. 485–494, doi:10.1145/1806689.1806757.
  14. Jonathan S. Golan (1999): Semirings and their Applications. Kluwer Academic, Dordrecht, doi:10.1007/978-94-015-9333-5.
  15. Udo Hebisch & Hanns J. Weinert (1998): Semirings. World Scientific, doi:10.1142/3903.
  16. Udo Hebisch & Hanns Joachim Weinert (1998): Semirings: algebraic theory and applications in computer science 5. World Scientific, doi:10.1142/9789812815965_bmatter.
  17. Dan Jurafsky & James H. Martin (2008): Speech and language processing. Prentice Hall.
  18. Daniel Kirsten (2011): The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. Acta Cybernet. 20(2), pp. 211–221, doi:10.14232/actacyb.20.2.2011.1.
  19. Tetris Holding; The Tetris Company LLC (1985): Tetris. Available at https://tetris.com.
  20. Christof Loding & Wolfgang Thomas (2000): Alternating Automata and Logics over Infinite Words. In: Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses & Takayasu Ito: Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. Springer Berlin Heidelberg, doi:10.1007/3-540-44929-9_36.
  21. Andreas Maletti & Andreea-Teodora Nász (2022): Weighted tree automata with constraints. In: Developments in Language Theory: 26th International Conference, DLT 2022, Tampa, FL, USA, May 9–13, 2022, Proceedings. Springer, pp. 226–238, doi:10.1007/978-3-031-05578-2_18.
  22. Andreas Maletti & Andreea-Teodora Nász (2023): Weighted Tree Automata with Constraints. Technical Report 2302.03434. arXiv. Available at https://arxiv.org/abs/2302.03434.
  23. Andreas Maletti, Andreea-Teodora Nász & Erik Paul (2023): Weighted HOM-Problem for Nonnegative Integers. ArXiv:2305.04117.
  24. Mehryar Mohri & Michael D. Riley (2017): A disambiguation algorithm for weighted automata. Theoretical Computer Science 679, pp. 53–68, doi:10.1016/j.tcs.2016.08.019. Available at https://www.sciencedirect.com/science/article/pii/S0304397516304376. Implementation and Application of Automata.
  25. J. Mongy-Steen (1981): Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. Université de Lille.
  26. Dominique Perrin (1984): Recent results on automata and infinite words. In: Proc.\@m 11th Int.\@m Symp.\@m Mathematical Foundations of Computer Science, LNCS 176. Springer, pp. 134–148, doi:10.1007/BFb0030294.
  27. Azriel Rosenfeld (2014): Picture languages: formal models for picture recognition. Academic Press.
  28. Arto Salomaa & Matti Soittola (1978): Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, doi:10.1007/978-1-4612-6264-0.
  29. Marcel Paul Schützenberger (1961): On the definition of a family of automata. Inform.\@m and Control 4(2–3), pp. 245–270, doi:10.1016/S0019-9958(61)80020-X.
  30. Kevin Stier & Markus Ulbricht (2021): Disambiguation of Weighted Tree Automata. In: Yo-Sub Han & Sang-Ki Ko: Descriptional Complexity of Formal Systems. Springer International Publishing, Cham, pp. 163–175, doi:10.1007/978-3-030-93489-7_14.
  31. James W. Thatcher (1967): Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory. J.\@m Comput.\@m Syst.\@m Sci. 1(4), pp. 317–322, doi:10.1016/S0022-0000(67)80022-9.
  32. James W. Thatcher & Jesse B. Wright (1968): Generalized finite automata theory with an application to a decision problem of second-order logic. Math.\@m Systems Theory 2(1), pp. 57–81, doi:10.1007/BF01691346.
  33. Reinhard Wilhelm, Helmut Seidl & Sebastian Hack (2013): Compiler Design - Syntactic and Semantic Analysis. Springer, doi:10.1007/978-3-642-17540-4.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org