周期性迭代的态射

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2012-07-10 DOI:10.1145/2603088.2603152

J. Endrullis, D. Hendriks

{"title":"周期性迭代的态射","authors":"J. Endrullis, D. Hendriks","doi":"10.1145/2603088.2603152","DOIUrl":null,"url":null,"abstract":"We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control; we call them PerD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PerD0L words. We construct a PerD0L word with exponential subword complexity, thereby answering a question raised by Lepistö [23] on the existence of such words. We solve another open problem concerning the decidability of the first-order theories of PerD0L words [24]; we show it is already undecidable whether a certain letter occurs in a PerD0L word.","PeriodicalId":20649,"journal":{"name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On periodically iterated morphisms\",\"authors\":\"J. Endrullis, D. Hendriks\",\"doi\":\"10.1145/2603088.2603152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control; we call them PerD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PerD0L words. We construct a PerD0L word with exponential subword complexity, thereby answering a question raised by Lepistö [23] on the existence of such words. We solve another open problem concerning the decidability of the first-order theories of PerD0L words [24]; we show it is already undecidable whether a certain letter occurs in a PerD0L word.\",\"PeriodicalId\":20649,\"journal\":{\"name\":\"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2603088.2603152\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2603088.2603152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们研究了周期迭代态射的计算能力，也称为具有周期控制的D0L系统;我们简称它们为PerD0L系统。这些系统产生了一类单侧无限序列，称为PerD0L词。我们构建了一个具有指数级子词复杂度的PerD0L词，从而回答了Lepistö[23]提出的关于此类词是否存在的问题。我们解决了另一个关于PerD0L词的一阶理论的可决性的开放问题[24];我们表明，某个字母是否出现在PerD0L单词中已经无法确定。

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

查看原文本刊更多论文

On periodically iterated morphisms

We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control; we call them PerD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PerD0L words. We construct a PerD0L word with exponential subword complexity, thereby answering a question raised by Lepistö [23] on the existence of such words. We solve another open problem concerning the decidability of the first-order theories of PerD0L words [24]; we show it is already undecidable whether a certain letter occurs in a PerD0L word.

求助全文

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

来源期刊

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

自引率

0.00%

发文量