带约束的加权树自动机

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Theory of Computing Systems Pub Date : 2023-10-03 DOI:10.1007/s00224-023-10144-w

Andreas Maletti, Andreea-Teodora Nász

{"title":"带约束的加权树自动机","authors":"Andreas Maletti, Andreea-Teodora Nász","doi":"10.1007/s00224-023-10144-w","DOIUrl":null,"url":null,"abstract":"Abstract The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages. It is demonstrated that the main notion used in the unweighted setting, the tree automaton with equality and inequality constraints , can straightforwardly be generalized to the weighted setting and can represent the image of any regular weighted tree language under any nondeleting and nonerasing tree homomorphism. Several closure properties as well as decision problems are also investigated for the weighted tree languages generated by weighted tree automata with constraints.","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Weighted Tree Automata with Constraints\",\"authors\":\"Andreas Maletti, Andreea-Teodora Nász\",\"doi\":\"10.1007/s00224-023-10144-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages. It is demonstrated that the main notion used in the unweighted setting, the tree automaton with equality and inequality constraints , can straightforwardly be generalized to the weighted setting and can represent the image of any regular weighted tree language under any nondeleting and nonerasing tree homomorphism. Several closure properties as well as decision problems are also investigated for the weighted tree languages generated by weighted tree automata with constraints.\",\"PeriodicalId\":22832,\"journal\":{\"name\":\"Theory of Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory of Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s00224-023-10144-w\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory of Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00224-023-10144-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

HOM问题，即在给定的树同态下，正则树语言的象是否又是正则的问题，已知是可判定的[Godoy &吉姆·梅内斯:HOM问题是可以确定的。中国生物医学工程学报，2013(4)。然而，对于常规加权树语言来说，这个问题仍然存在。证明了在非加权集合中使用的主要概念，即具有相等和不等式约束的树自动机，可以直接推广到加权集合中，并且可以表示任何正则加权树语言在任何非删除和非擦除树同态下的图像。研究了由带约束的加权树自动机生成的加权树语言的闭包性质和决策问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Weighted Tree Automata with Constraints

查看原文本刊更多论文

Weighted Tree Automata with Constraints

Abstract The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages. It is demonstrated that the main notion used in the unweighted setting, the tree automaton with equality and inequality constraints , can straightforwardly be generalized to the weighted setting and can represent the image of any regular weighted tree language under any nondeleting and nonerasing tree homomorphism. Several closure properties as well as decision problems are also investigated for the weighted tree languages generated by weighted tree automata with constraints.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theory of Computing Systems 工程技术-计算机：理论方法

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.