形式为pqm的非原语单词

RAIRO Theor. Informatics Appl. Pub Date : 2017-07-01 DOI:10.1051/ita/2017012

Othman Echi

{"title":"形式为pqm的非原语单词","authors":"Othman Echi","doi":"10.1051/ita/2017012","DOIUrl":null,"url":null,"abstract":"Let p,q be two distinct primitive words. According to Lentin−Schutzenberger [], the language p + q + contains at most one non-primitive word and if p q m is not primitive, then . In this paper we give a sharper upper bound, namely, where ⌊ x ⌋ stands for the floor of x .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Non-primitive words of the form pqm\",\"authors\":\"Othman Echi\",\"doi\":\"10.1051/ita/2017012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let p,q be two distinct primitive words. According to Lentin−Schutzenberger [], the language p + q + contains at most one non-primitive word and if p q m is not primitive, then . In this paper we give a sharper upper bound, namely, where ⌊ x ⌋ stands for the floor of x .\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2017012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2017012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

设p q是两个不同的原始词。根据Lentin−Schutzenberger[]，语言p + q +最多包含一个非原语单词，如果p q m不是原语，则。在本文中，我们给出了一个更清晰的上界，即，其中⌊x⌋表示x的下限。

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

查看原文本刊更多论文

Non-primitive words of the form pqm

Let p,q be two distinct primitive words. According to Lentin−Schutzenberger [], the language p + q + contains at most one non-primitive word and if p q m is not primitive, then . In this paper we give a sharper upper bound, namely, where ⌊ x ⌋ stands for the floor of x .

求助全文

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

来源期刊

RAIRO Theor. Informatics Appl.

自引率

0.00%

发文量