Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Finite automata and pattern avoidance in words
2005 (engelsk)Inngår i: Journal of combinatorial theory. Series A (Print), ISSN 0097-3165, E-ISSN 1096-0899, Vol. 110, nr 1, s. 127-145Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

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...(l + 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.

sted, utgiver, år, opplag, sider
2005. Vol. 110, nr 1, s. 127-145
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-78741DOI: 10.1016/j.jcta.2004.10.007ISI: 000228439100008OAI: oai:DiVA.org:kth-78741DiVA, id: diva2:492831
Merknad
QC 20120227Tilgjengelig fra: 2012-02-08 Laget: 2012-02-08 Sist oppdatert: 2017-12-08bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fullteksthttp://dx.doi.org/10.1016/j.jcta.2004.10.007

Personposter BETA

Brändén, Petter

Søk i DiVA

Av forfatter/redaktør
Brändén, Petter
I samme tidsskrift
Journal of combinatorial theory. Series A (Print)

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 14 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf