Finding Patterns Common to a Set of Strings

Angluin, D. (1980). Finding Patterns Common to a Set of Strings. Journal of Computer and System Sciences, 0000(80), 46-62.

Type

Journal article

Intellectual base

Primary research

Year

1980

DOI

10.1016/0022-0000(80)90041-0

Link

https://doi.org/10.1016/0022-0000(80)90041-0

Cited by

1 citation across 1 artifact.

Domain-specific

• Pattern Language (Formal Languages)
  • Its pattern language contains exactly the nonempty terminal words obtained by consistently replacing each occurrence of a variable with the same nonempty word over \(\Sigma\), while each constant remains fixed.

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