Finite automata and pattern avoidance in words
Artikel i vetenskaplig tidskrift, 2005

We say that a word w on a totally ordered alphabet avoids the word v if there are no subsequences in w order-equivalent to v. In this paper we suggest a new approach to the enumeration of words on at most k letters avoiding a given pattern. By studying an automaton which for fixed k generates the words avoiding a given pattern we derive several previously known results for these kind of problems, as well as many new. In particular, we give a simple proof of the formula (Electron. J. Combin. 5(1998) #R15) for exact asymptotics for the number of words on k letters of length n that avoids the pattern 12 ⋯ (ℓ + 1). Moreover, we give the first combinatorial proof of the exact formula (Enumeration of words with forbidden patterns, Ph.D. Thesis, University of Pennsylvania, 1998) for the number of words on k letters of length n avoiding a three letter permutation pattern. © 2004 Elsevier Inc. All rights reserved.

permutations

Författare

Petter Brändén

Chalmers, Matematiska vetenskaper, Matematik

Göteborgs universitet

Toufik Mansour

University of Haifa

Journal of Combinatorial Theory - Series A

0097-3165 (ISSN)

Vol. 110 1 127-145

Ämneskategorier

Matematik

DOI

10.1016/j.jcta.2004.10.007