# Discrete Mathematics & Theoretical Computer Science

## Volume 5 n° 1 (2002), pp. 17-46

author: | Anton Černý |
---|---|

title: | Lyndon factorization of generalized words of Thue |

keywords: | Lyndon word, Lyndon factorization, automatic sequence |

abstract: | The i-th symbol of the well-known infinite word of Thue on the alphabet {0,1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary w∈{0,1}^{*}-0^{*} in the binary notation of i. We provide here the standard Lyndon factorization of some subclasses of this class of infinite words.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |

reference: | Anton Cerny (2002),
Lyndon factorization of generalized words of Thue,
Discrete Mathematics and Theoretical Computer Science 5, pp. 17-46 |

bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |

ps.gz-source: | dm050102.ps.gz (95 K) |

ps-source: | dm050102.ps (332 K) |

pdf-source: | dm050102.pdf (229 K) |

The first *source* gives you the `gzipped' PostScript, the second the plain
PostScript and the third the format for the Adobe accrobat
reader. Depending on the installation of your web browser, at least
one of these should (after some amount of time) pop up a window for
you that shows the full article. If this is not the case, you should
contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.

Automatically produced on Mon Mar 25 21:26:51 CET 2002 by ifalk