Polynomial-Time Algorithms for Learning Typed Pattern Languages

DOI10.1007/978-3-642-28332-1_24zbMath1351.68124OpenAlexW8836454MaRDI QIDQ2890199

Michael Geilke, Sandra Zilles

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_24

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (2)

Distinguishing pattern languages with membership examples ⋮ Languages generated by conjunctive query fragments of FC[REG]

This page was built for publication: Polynomial-Time Algorithms for Learning Typed Pattern Languages