Document Open Access Logo

Weighted HOM-Problem for Nonnegative Integers

Authors Andreas Maletti , Andreea-Teodora Nász , Erik Paul

PDF
Thumbnail PDF

File

LIPIcs.STACS.2024.51.pdf
  • Filesize: 0.81 MB
  • 17 pages

Document Identifiers

Author Details

Andreas Maletti
  • Institute of Computer Science, Leipzig University, Germany
Andreea-Teodora Nász
  • Institute of Computer Science, Leipzig University, Germany
Erik Paul
  • Institute of Computer Science, Leipzig University, Germany

Cite AsGet BibTex

Andreas Maletti, Andreea-Teodora Nász, and Erik Paul. Weighted HOM-Problem for Nonnegative Integers. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 51:1-51:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.STACS.2024.51

Abstract

The HOM-problem asks whether the image of a regular tree language under a given tree homomorphism is again regular. It was recently shown to be decidable by Godoy, Giménez, Ramos, and Àlvarez. In this paper, the ℕ-weighted version of this problem is considered and its decidability is proved. More precisely, it is decidable in polynomial time whether the image of a regular ℕ-weighted tree language under a nondeleting, nonerasing tree homomorphism is regular.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantitative automata
  • Theory of computation → Computability
  • Theory of computation → Tree languages
  • Theory of computation → Grammars and context-free languages
Keywords
  • Weighted Tree Automaton
  • Decision Problem
  • Subtree Equality Constraint
  • Tree Homomorphism
  • HOM-Problem
  • Weighted Tree Grammar
  • Weighted HOM-Problem

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Adel Bouhoula and Florent Jacquemard. Tree automata, implicit induction and explicit destructors for security protocol verification. Technical report, Research Report LSV-07-10, 2007. Google Scholar
  2. Adel Bouhoula and Florent Jacquemard. Automated induction with constrained tree automata. In International Joint Conference on Automated Reasoning, pages 539-554. Springer, 2008. Google Scholar
  3. Symeon Bozapalidis and Antonios Kalampakas. Graph automata. Theoret. Comput. Sci., 393(1-3):147-165, 2008. URL: https://doi.org/10.1016/j.tcs.2007.11.022.
  4. Symeon Bozapalidis and George Rahonis. On the closure of recognizable tree series under tree homomorphisms. J. Autom. Lang. Comb., 10(2-3):185-202, 2005. URL: https://doi.org/10.25596/jalc-2005-185.
  5. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata - Techniques and Applications. https://jacquema.gitlabpages.inria.fr/files/tata.pdf, 2007.
  6. Carles Creus, Adrià Gascón, Guillem Godoy, and Lander Ramos. The HOM problem is EXPTIME-complete. SIAM J. Comput., 45(4):1230-1260, 2016. URL: https://doi.org/10.1137/140999104.
  7. John Doner. Tree acceptors and some of their applications. J. Comput. System Sci., 4(5):406-451, 1970. URL: https://doi.org/10.1016/S0022-0000(70)80041-1.
  8. Frank Drewes. Grammatical picture generation: A tree-based approach. Springer, 2006. URL: https://doi.org/10.1007/3-540-32507-7.
  9. Zoltán Ésik and Werner Kuich. Formal tree series. J. Autom. Lang. Comb., 8(2):219-285, 2003. URL: https://doi.org/10.25596/jalc-2003-219.
  10. Zoltán Fülöp, Andreas Maletti, and Heiko Vogler. Preservation of recognizability for synchronous tree substitution grammars. In Proc. Workshop Applications of Tree Automata in Natural Language Processing, pages 1-9. ACL, 2010. URL: https://aclanthology.org/W10-2501.
  11. Zoltán Fülöp, Andreas Maletti, and Heiko Vogler. Weighted extended tree transducers. Fundam. Inform., 111(2):163-202, 2011. URL: https://doi.org/10.3233/FI-2011-559.
  12. Zoltán Fülöp and Heiko Vogler. Weighted tree automata and tree transducers. In Handbook of Weighted Automata, chapter 9, pages 313-403. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-01492-5_9.
  13. Ferenc Gécseg and Magnus Steinby. Tree automata. Technical Report 1509.06233, arXiv, 2015. URL: https://arxiv.org/pdf/1509.06233.pdf.
  14. Rémy Gilleron and Sophie Tison. Regular tree languages and rewrite systems. Fundamenta informaticae, 24(1-2):157-175, 1995. Google Scholar
  15. Guillem Godoy and Omer Giménez. The HOM problem is decidable. J. ACM, 60(4):1-44, 2013. URL: https://doi.org/10.1145/2508028.2501600.
  16. Guillem Godoy, Omer Giménez, Lander Ramos, and Carme Àlvarez. The HOM problem is decidable. In Proc. 42nd ACM Symp. Theory of Computing, pages 485-494. ACM, 2010. Google Scholar
  17. Jonathan S. Golan. Semirings and their Applications. Kluwer Academic, Dordrecht, 1999. URL: https://doi.org/10.1007/978-94-015-9333-5.
  18. Udo Hebisch and Hanns J. Weinert. Semirings - Algebraic Theory and Applications in Computer Science. World Scientific, 1998. URL: https://doi.org/10.1142/3903.
  19. Dan Jurafsky and James H. Martin. Speech and language processing. Prentice Hall, 3rd edition, 2023. URL: https://web.stanford.edu/~jurafsky/slp3/ed3book.pdf.
  20. Andreas Maletti and Andreea-Teodora Nász. Weighted tree automata with constraints. Theory Comput. Syst., 2023. to appear. URL: https://arxiv.org/pdf/2302.03434.pdf.
  21. J. Mongy-Steen. Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Université de Lille, 1981. Google Scholar
  22. Andreea-Teodora Nász. Solving the weighted HOM-problem with the help of unambiguity. In Proc. 16th Int. Conf. Automata and Formal Languages, volume 386 of EPTCS, pages 200-214. Open Publishing Association, 2023. URL: https://doi.org/10.4204/EPTCS.386.16.
  23. Dominique Perrin. Recent results on automata and infinite words. In Proc. 11th Int. Symp. Mathematical Foundations of Computer Science, volume 176 of LNCS, pages 134-148. Springer, 1984. URL: https://doi.org/10.1007/BFb0030294.
  24. F. P. Ramsey. On a problem of formal logic. Proc. London Math. Soc, 30, 1930. URL: https://doi.org/10.1112/plms/s2-30.1.264.
  25. Arto Salomaa and Matti Soittola. Automata-theoretic aspects of formal power series. Springer, 1978. URL: https://doi.org/10.1007/978-1-4612-6264-0.
  26. Marcel Paul Schützenberger. On the definition of a family of automata. Inform. and Control, 4(2-3):245-270, 1961. URL: https://doi.org/10.1016/S0019-9958(61)80020-X.
  27. James W. Thatcher. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci., 1(4):317-322, 1967. URL: https://doi.org/10.1016/S0022-0000(67)80022-9.
  28. James W. Thatcher and Jesse B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory, 2(1):57-81, 1968. URL: https://doi.org/10.1007/BF01691346.
  29. Reinhard Wilhelm, Helmut Seidl, and Sebastian Hack. Compiler Design. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-17540-4.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact