Characterization of some binary words with few squares
- Submitting institution
-
Goldsmiths' College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 3280
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2015.03.044
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 73
- Volume
- 588
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2015
- URL
-
http://research.gold.ac.uk/id/eprint/28016/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Study of words with few redundancies have been triggered in the early years of the twentieth century by Thue. It is known that there exists no infinite binary word containing fewer than three squares (two consecutive identical blocks). In the ternary case, there exists an infinite word avoiding squares. This paper gives a smaller morphism for Thue’s word which was standing for almost 100 years. In addition it characterizes seven other classes of infinite words using morphisms.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -