On Long Words Avoiding Zimin Patterns

Carayol, A., & Göller, S. (2017). On Long Words Avoiding Zimin Patterns. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017).

Type

Preprint

Intellectual base

Grey literature

Year

2017

DOI

10.4230/lipics.stacs.2017.19

Link

https://doi.org/10.4230/LIPIcs.STACS.2017.19

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 sourceStates the nonerasing-infix encounter definition, the every-finite-alphabet quantifiers, the Zimin characterization, and quantitative threshold bounds.

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:407add5050a2 · see in the full table