关于一阶可定义树状语言的一些评论

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-07-01 DOI:arxiv-2407.01169

Achim Blumensath

{"title":"关于一阶可定义树状语言的一些评论","authors":"Achim Blumensath","doi":"arxiv-2407.01169","DOIUrl":null,"url":null,"abstract":"We study the question of whether a given regular language of finite trees can\nbe defined in first-order logic. We develop an algebraic approach to address\nthis question and we use it to derive several necessary and sufficient\nconditions for definability (but unfortunately no condition that is both). The\nmain difference of our results to those from the literature is that our\nconditions are decidable.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"29 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Remarks on First-Order Definable Tree Languages\",\"authors\":\"Achim Blumensath\",\"doi\":\"arxiv-2407.01169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the question of whether a given regular language of finite trees can\\nbe defined in first-order logic. We develop an algebraic approach to address\\nthis question and we use it to derive several necessary and sufficient\\nconditions for definability (but unfortunately no condition that is both). The\\nmain difference of our results to those from the literature is that our\\nconditions are decidable.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-01\",\"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-2407.01169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.01169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们研究的问题是，给定的有限树正则语言是否可以用一阶逻辑来定义。我们开发了一种代数方法来解决这个问题，并用它推导出了可定义性的几个必要条件和充分条件（但遗憾的是，没有一个条件同时具备）。我们的结果与文献中的结果的主要区别在于，我们的条件是可解的。

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

查看原文本刊更多论文

Some Remarks on First-Order Definable Tree Languages

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for definability (but unfortunately no condition that is both). The main difference of our results to those from the literature is that our conditions are decidable.

求助全文

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

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量