Enumeration of r-smooth words over a finite alphabet

Toufik Mansour; José L. Ramírez; Diego Villamizar

doi:10.47443/dml.2022.175

Enumeration of r-smooth words over a finite alphabet

Toufik Mansour, José L. Ramírez, Diego Villamizar

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we enumerate a restricted family of k-ary words called r-smooth words. The restriction is defined 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.

Original language	American English
Pages (from-to)	68-75
Number of pages	8
Journal	Discrete Mathematics Letters
Volume	11
DOIs	https://doi.org/10.47443/dml.2022.175
State	Published - 2023

Keywords

automata
generating function
k-ary word

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics

Access to Document

10.47443/dml.2022.175

Cite this

@article{9376985355384bb783d59fd791fa9918,

title = "Enumeration of r-smooth words over a finite alphabet",

abstract = "In this paper, we enumerate a restricted family of k-ary words called r-smooth words. The restriction is defined 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.",

keywords = "automata, generating function, k-ary word",

author = "Toufik Mansour and Ram{\'i}rez, {Jos{\'e} L.} and Diego Villamizar",

note = "Publisher Copyright: {\textcopyright} 2023 the authors.",

year = "2023",

doi = "10.47443/dml.2022.175",

language = "American English",

volume = "11",

pages = "68--75",

journal = "Discrete Mathematics Letters",

issn = "2664-2557",

publisher = "Shahin Digital Publisher",

}

TY - JOUR

T1 - Enumeration of r-smooth words over a finite alphabet

AU - Mansour, Toufik

AU - Ramírez, José L.

AU - Villamizar, Diego

PY - 2023

Y1 - 2023

N2 - In this paper, we enumerate a restricted family of k-ary words called r-smooth words. The restriction is defined 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.

AB - In this paper, we enumerate a restricted family of k-ary words called r-smooth words. The restriction is defined 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.

KW - automata

KW - generating function

KW - k-ary word

UR - http://www.scopus.com/inward/record.url?scp=85150046509&partnerID=8YFLogxK

U2 - 10.47443/dml.2022.175

DO - 10.47443/dml.2022.175

M3 - Article

SN - 2664-2557

VL - 11

SP - 68

EP - 75

JO - Discrete Mathematics Letters

JF - Discrete Mathematics Letters

ER -

Enumeration of r-smooth words over a finite alphabet

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this