Blocking Sets of Terms

Zimin, A. I. (1984). Blocking Sets of Terms. Mathematics of the USSR-Sbornik.

Type

Journal article

Intellectual base

Primary research

Year

1984

DOI

10.1070/sm1984v047n02abeh002647

Link

https://doi.org/10.1070/SM1984v047n02ABEH002647

Cited by

1 citation across 1 artifact.

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

Domain-specific

• Unavoidable Pattern
  • … supports arbitrarily long `p`-free words, equivalently an infinite `p`-free word. The classical Zimin–Bean–Ehrenfeucht–McNulty characterization turns this global condition into a finite pattern test: a pattern using `n` distinct variables is unavoidable exactly when it is encountered in the `n`th Zimin pattern.

    This sourcePrimary blocking-term characterization underlying the Zimin-pattern criterion.

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.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://www.mathnet.ru/sm2889 ×1

Registry ID ref:fdb5ecd76e78 · see in the full table