Finding patterns common to a set of strings
type: Item
instance of: scholarly article
title: Finding patterns common to a set of strings
zbMATH Open document ID: 0454.68108
DOI: 10.1016/0022-0000(80)90041-0
published in: Journal of Computer and System Sciences
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 3711445
author: Dana Angluin
describes a project that uses: SNOBOL
MaRDI profile type: Publication
full work available at URL: 0022-0000(80)90041-0
OpenAlex ID: W1965415591
Wikidata QID: Q56485132
cites work: Q4773298
cites work: Inductive inference of formal languages from positive data
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Complexity of automaton identification from given data
cites work: Q5772619
cites work: Q5592246
cites work: Fast Pattern Matching in Strings
cites work: Q4159542
description: scientific article; zbMATH DE number 3711445