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, 46-62.

Type

Journal article

Intellectual base

Primary research

Year

1980

Pages

46-62

ISSN

0022-0000

DOI

10.1016/0022-0000(80)90041-0

DOI registrant

Elsevier

Link

https://www.sciencedirect.com/science/article/pii/0022000080900410

Cited by

2 citations across 2 artifacts.

Domain-specific

• Finite Thickness
  • The bound changes with \(n\).
• 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

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. Neither this nor any other of the 2 citations of this work carries a 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:a3fbae2e379b · see in the full table