A note on the two-variable pattern-finding problem

DOI10.1016/0022-0000(87)90006-7zbMath0635.68097OpenAlexW2028891561MaRDI QIDQ1097711

Chin-Ming Hua, Ker-I. Ko

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90006-7

zbMATH Keywords

NP-completeinductive inferencepattern languagepattern-finding problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99) Complexity of computation (including implicit computational complexity) (03D15)

Related Items

Identification of pattern languages from examples and queries ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Three \(\sum^ P_ 2\)-complete problems in computational learning theory ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Cites Work

• Finding patterns common to a set of strings
• Unnamed Item
• Unnamed Item