On some factorizations of infinite words by elements of codes
β Scribed by J. Justin; G. Pirillo
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 621 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that an infinite word s satisfies s = uoutu2 . . . with all ui being different nonempty words and their set being a biprefix code if and only if s is not ultimately periodic. We give also related results, considering in particular arbitrary codes, infix codes and the case of two-sided infinite words. @
π SIMILAR VOLUMES
Glass fibre-reinforced plastics (GFRP) composite materials are used in many different engineering fields. The need for machining of GFRP composites has not been eliminated fully. The tool wear reduction is an important aspect during machining. In the present work, an attempt has been made to assess