Identification of pattern languages from examples and queries

DOI10.1016/0890-5401(87)90026-5zbMath0635.68096OpenAlexW2022629746MaRDI QIDQ1097709

Assaf Marron, Ker-I. Ko

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90026-5

zbMATH Keywords

learninginductive inferencepolynomial-timepattern 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

Closure properties of pattern languages, Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries, Learning regular languages from counterexamples, In Memoriam: Ker-I Ko (1950–2018), Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Learning erasing pattern languages with queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the two-variable pattern-finding problem
• Finding patterns common to a set of strings
• System identification via state characterization
• A theory of the learnable
• A solution of the syntactical induction-inference problem for regular languages
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• A note on the number of queries needed to identify regular languages
• Language identification in the limit