{"title":"Global One-Counter Tree Automata","authors":"Luisa Herrmann, Richard Mörbitz","doi":"arxiv-2406.15090","DOIUrl":null,"url":null,"abstract":"We introduce global one-counter tree automata (GOCTA) which deviate from\nusual counter tree automata by working on only one counter which is passed\nthrough the tree in lexicographical order, rather than duplicating the counter\nat every branching position. We compare the capabilities of GOCTA to those of\ncounter tree automata and obtain that their classes of recognizable tree\nlanguages are incomparable. Moreover, we show that the emptiness problem of\nGOCTA is undecidable while, in stark contrast, their membership problem is in\nP.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"19 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.15090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce global one-counter tree automata (GOCTA) which deviate from
usual counter tree automata by working on only one counter which is passed
through the tree in lexicographical order, rather than duplicating the counter
at every branching position. We compare the capabilities of GOCTA to those of
counter tree automata and obtain that their classes of recognizable tree
languages are incomparable. Moreover, we show that the emptiness problem of
GOCTA is undecidable while, in stark contrast, their membership problem is in
P.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
