Reference : On the Number of Abelian Bordered Words
Scientific congresses and symposiums : Paper published in a journal
Physical, chemical, mathematical & earth Sciences : Mathematics
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/144646
On the Number of Abelian Bordered Words
English
Rampersad, Narad []
Rigo, Michel mailto [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
Salimov, Pavel [Université de Liège - ULg > Département de mathématique > Mathématiques discrètes >]
2013
Lecture Notes in Computer Science
Springer
7907
420-432
Yes
International
0302-9743
1611-3349
Berlin
Germany
Developments in Language Theory
from 18-06-2013 to 21-06-2013
M.-P. Béal, O. Carton
Marne-La-Vallée (Paris)
France
[en] Combinatorics ; Bordered words ; Motzkin paths
[en] In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in Z not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number of these words. In particular, over a 3-letter alphabet, the connection with paths in the triangular lattice is made. Finally, we study the lengths of the abelian unbordered factors occurring in the Thue--Morse word.
Researchers
http://hdl.handle.net/2268/144646
10.1007/978-3-642-38771-5_37

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Restricted access
finalDLT2013.pdfAuthor preprint168.13 kBRequest copy

Additional material(s):

File Commentary Size Access
Open access
RigoDLT2013.pdfSlides of the conference talk345.41 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.