Counting bordered and primitive words with a fixed weight

Theoretical Computer Science

Volumn 340, Issue 2, 2005, Pages 273-279

  Harju, Tero ^a   Nowotka, Dirk ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Borders; Combinatorics on words; M bius function; Primitive words

Indexed keywords

DATABASE SYSTEMS; FUNCTIONS; LINGUISTICS; SET THEORY; THEOREM PROVING; VECTORS;

BORDERS; COMBINATORICS ON WORDS; MÖBIUS FUNCTION; PRIMITIVE WORDS;

WORD PROCESSING;

EID: 20344373641     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.040     Document Type: Article

References (7)

1. H. Harborth Endliche 0 - 1 -Folgen mit gleichen Teilblöcken J. Reine Angew. Math. 271 1974 139 154
2. M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley Publishing Co., Reading, MA, 1983.
3. H. Petersen On the language of primitive words Theoret. Comput. Sci. 161 1-2 1996 141 156
4. M. Régnier Enumeration of bordered words, The Language of the Laughing Cow RAIRO Inform. Théor. Appl. 26 4 1992 303 317
5. I. Simon String matching algorithms and automata Results and Trends in Theoretical Computer Science, Graz 1994, Lecture Notes in Computer Science Vol. 812 1994 Springer Berlin 386 395
6. N.J.A. Sloane, On-line encyclopedia of integer sequences, http://www.research.att.com/∼njas/sequences/.
7. P. Tolstrup Nielsen A note on bifix-free sequences IEEE Trans. Inform. Theory IT-19 1973 704 706