Words over a finite alphabet avoiding 1243

Toufik Mansour

doi:10.2989/16073606.2024.2334869

Words over a finite alphabet avoiding 1243

Toufik Mansour

Department of Mathematics

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

Abstract

Abstract.: In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function A_k(x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function A_k(x) for 1 ≤ k ≤ 10.

Original language	English
Journal	Quaestiones Mathematicae
DOIs	https://doi.org/10.2989/16073606.2024.2334869
State	Accepted/In press - 2024

Bibliographical note

Publisher Copyright:
© 2024 NISC (Pty) Ltd.

Keywords

avoiding 1243
k-ary words
kernel method

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.2989/16073606.2024.2334869

Cite this

@article{d64ac2f998eb4fd3920466c7ce88b5c8,

title = "Words over a finite alphabet avoiding 1243",

abstract = "Abstract.: In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function Ak(x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function Ak(x) for 1 ≤ k ≤ 10.",

keywords = "avoiding 1243, k-ary words, kernel method",

author = "Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2024 NISC (Pty) Ltd.",

year = "2024",

doi = "10.2989/16073606.2024.2334869",

language = "English",

journal = "Quaestiones Mathematicae",

issn = "1607-3606",

publisher = "Taylor and Francis Ltd.",

}

TY - JOUR

T1 - Words over a finite alphabet avoiding 1243

AU - Mansour, Toufik

PY - 2024

Y1 - 2024

N2 - Abstract.: In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function Ak(x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function Ak(x) for 1 ≤ k ≤ 10.

AB - Abstract.: In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function Ak(x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function Ak(x) for 1 ≤ k ≤ 10.

KW - avoiding 1243

KW - k-ary words

KW - kernel method

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

U2 - 10.2989/16073606.2024.2334869

DO - 10.2989/16073606.2024.2334869

M3 - Article

AN - SCOPUS:85192220819

SN - 1607-3606

JO - Quaestiones Mathematicae

JF - Quaestiones Mathematicae

ER -

Words over a finite alphabet avoiding 1243

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this