上下文语法与严格局部可测试选择语言的关系

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

Rairo-Theoretical Informatics and Applications Pub Date : 2023-01-01 DOI:10.1051/ita/2023012

Jürgen Dassow, Bianca Truthe

{"title":"上下文语法与严格局部可测试选择语言的关系","authors":"Jürgen Dassow, Bianca Truthe","doi":"10.1051/ita/2023012","DOIUrl":null,"url":null,"abstract":"We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate the computational capacity of contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages. With these results, also an open problem regarding ordered and non-counting selection languages is solved.","PeriodicalId":54510,"journal":{"name":"Rairo-Theoretical Informatics and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relations of contextual grammars with strictly locally testable selection languages\",\"authors\":\"Jürgen Dassow, Bianca Truthe\",\"doi\":\"10.1051/ita/2023012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate the computational capacity of contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages. With these results, also an open problem regarding ordered and non-counting selection languages is solved.\",\"PeriodicalId\":54510,\"journal\":{\"name\":\"Rairo-Theoretical Informatics and Applications\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rairo-Theoretical Informatics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2023012\",\"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":"Rairo-Theoretical Informatics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2023012","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们继续研究上下文语法的生成能力，其中上下文是围绕整个词(外部)或围绕子词(内部)，属于特殊的规则选择语言。所有由上下文语法生成的语言，其中所有选择语言都是某个次规则语族的元素，再次形成一个语族。我们研究了具有严格局部可测试选择语言的上下文语法的计算能力，并将这些家族与基于有限，一元，幂零，组合，确定，词尾封闭，有序，交换，循环，非计数，幂分离或无联合语言的家族进行了比较。这些结果也解决了一个关于有序和非计数选择语言的开放性问题。

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

查看原文本刊更多论文

Relations of contextual grammars with strictly locally testable selection languages

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate the computational capacity of contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages. With these results, also an open problem regarding ordered and non-counting selection languages is solved.

求助全文

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

来源期刊

Rairo-Theoretical Informatics and Applications 工程技术-计算机：信息系统

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The journal publishes original research papers of high scientific level in the area of theoretical computer science and its applications. Theoretical computer science is understood in its broadest sense and comprises in particular the following areas: automata and formal languages, game theory, rewriting systems, design and analysis of algorithms, complexity theory, quantum computation, concurrent, distributed, parallel computations, verification of programs, “logic” and compilers, computational geometry and graphics on computers, cryptography, combinatorics on words. This list is not supposed to be exhaustive and the editorial board will promote new fields of research that will be worked out in the future.