Checking in polynomial time whether or not a regular tree language is deterministic top-down

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Sebastian Maneth , Helmut Seidl
{"title":"Checking in polynomial time whether or not a regular tree language is deterministic top-down","authors":"Sebastian Maneth ,&nbsp;Helmut Seidl","doi":"10.1016/j.ipl.2023.106449","DOIUrl":null,"url":null,"abstract":"<div><p><span>It is well known that for a given bottom-up tree automaton it can be decided whether or not an equivalent deterministic top-down tree automaton exists. Recently it was claimed that such a decision can be carried out in </span>polynomial time<span> (Leupold and Maneth, FCT'2021); but their procedure and corresponding property is wrong. Here we address this mistake and present a correct property which allows to determine in polynomial time whether or not a given tree language can be recognized by a deterministic top-down tree automaton. Furthermore, our new property is stated for arbitrary deterministic bottom-up tree automata, and not only for minimal such automata (as before).</span></p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"184 ","pages":"Article 106449"},"PeriodicalIF":0.7000,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019023000923","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

It is well known that for a given bottom-up tree automaton it can be decided whether or not an equivalent deterministic top-down tree automaton exists. Recently it was claimed that such a decision can be carried out in polynomial time (Leupold and Maneth, FCT'2021); but their procedure and corresponding property is wrong. Here we address this mistake and present a correct property which allows to determine in polynomial time whether or not a given tree language can be recognized by a deterministic top-down tree automaton. Furthermore, our new property is stated for arbitrary deterministic bottom-up tree automata, and not only for minimal such automata (as before).

在多项式时间中检查正则树语言是否是自上而下的确定性语言
众所周知,对于给定的自下而上的树自动机,可以决定是否存在等价的确定自上而下的树自动机。最近有人声称,这样的决策可以在多项式时间内进行(Leupold和Maneth,FCT’2021);但它们的程序和相应的性质是错误的。在这里,我们解决了这个错误,并提出了一个正确的性质,该性质允许在多项式时间内确定给定的树语言是否可以被确定性自上而下的树自动机识别。此外,我们的新性质是针对任意确定性自下而上的树自动机,而不仅仅是针对最小的这种自动机(如前所述)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing Letters
Information Processing Letters 工程技术-计算机:信息系统
CiteScore
1.80
自引率
0.00%
发文量
70
审稿时长
7.3 months
期刊介绍: Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信