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

Pages cited

1-19

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:407add5050a2 · see in the full table