Avoidable Patterns in Strings of Symbols

Bean, D., Ehrenfeucht, A., & McNulty, G. (1979). Avoidable Patterns in Strings of Symbols. Pacific Journal of Mathematics.

Type

Journal article

Intellectual base

Primary research

Year

1979

DOI

10.2140/pjm.1979.85.261

Link

https://doi.org/10.2140/pjm.1979.85.261

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Unavoidable Pattern
  • A word `w ∈ Σ*` encounters `p` when some contiguous factor of `w` is `h(p)` for such an `h`.

    This sourcePrimary definitions of substitution instance, factor avoidance, finite-alphabet avoidability, and the infinite-word equivalence.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:c901bf0bc386 · see in the full table