No Detail Found!

Enumeration of r-smooth words over a finite alphabet

Author(s)
Toufik Mansour Department of Mathematics, University of Haifa,Haifa,Israel
Jose L. Ramirez Departamento de Matem a ́ticas, Universidad Nacional de Colombia,Bogot a ́,Colombia
Diego Villamizar Escuela de Ciencias Exactas e Ingenier ́ıa, Universidad Sergio Arboleda,Bogot a ́,Colombia
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.
Publication Details
Page(s) 68-75
Published Journal: Discrete Mathematics Letters, Volume: 11, Issue: 0, Year: 2023

Request the full text from PASTIC

Keywords
Generating Function, k-ary word, automata
0

Citations

0

Downloads

40

Views