Unavoidable binary patterns (Q1323331): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth problems for avoidable words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Avoidable patterns in strings of symbols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every binary pattern of length six is avoidable on the two-letter alphabet / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948609 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Avoidable patterns on two letters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: BLOCKING SETS OF TERMS / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:46, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unavoidable binary patterns |
scientific article |
Statements
Unavoidable binary patterns (English)
0 references
1993
0 references
Peter Roth proved that there are no binary patterns of length six or more that are unavoidable on the two-letter alphabet. He gave an almost complete description of unavoidable binary patterns. In this paper we prove one of his conjectures: the pattern \(\alpha^ 2\beta^ 2\alpha\) is 2-avoidable. From this we deduce the complete classification of unavoidable binary patterns. We also study the concept of avoidability by iterated morphisms and prove that there are a few 2-avoidable patterns which are not avoided by any iterated morphism.
0 references
unavoidable binary patterns
0 references
avoidability by iterated morphisms
0 references