有限字母表上r个光滑词的枚举

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2023-02-01 DOI:10.47443/dml.2022.175

T. Mansour, J. L. Ram´ırez, Diego Villamizar

{"title":"有限字母表上r个光滑词的枚举","authors":"T. Mansour, J. L. Ram´ırez, Diego Villamizar","doi":"10.47443/dml.2022.175","DOIUrl":null,"url":null,"abstract":"In this paper, we enumerate a restricted family of k -ary words called r -smooth words. The restriction is deﬁned through the distance between adjacent changes in the word. Using automata, we enumerate this family of words. Additionally, we give explicit combinatorial expressions to enumerate the words and asymptotic expansions related to the Fibonacci sequence","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enumeration of r-smooth words over a finite alphabet\",\"authors\":\"T. Mansour, J. L. Ram´ırez, Diego Villamizar\",\"doi\":\"10.47443/dml.2022.175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we enumerate a restricted family of k -ary words called r -smooth words. The restriction is deﬁned through the distance between adjacent changes in the word. Using automata, we enumerate this family of words. Additionally, we give explicit combinatorial expressions to enumerate the words and asymptotic expansions related to the Fibonacci sequence\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们列举了一个有限的k元词族，称为r -光滑词。限制是通过单词相邻变化之间的距离来定义的。使用自动机，我们枚举这类词。此外，我们给出了显式的组合表达式来枚举与斐波那契序列相关的词和渐近展开式

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

查看原文本刊更多论文

Enumeration of r-smooth words over a finite alphabet

In this paper, we enumerate a restricted family of k -ary words called r -smooth words. The restriction is deﬁned through the distance between adjacent changes in the word. Using automata, we enumerate this family of words. Additionally, we give explicit combinatorial expressions to enumerate the words and asymptotic expansions related to the Fibonacci sequence

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks