On the learnability of e-pattern languages over small alphabets

DOI10.1007/978-3-540-27819-1_10MaRDI QIDQ4680873zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98522, https://dspace.lboro.ac.uk/2134/3470

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• A non-learnable class of E-pattern languages
• STACS 2004
• On the equivalence problem for E-pattern languages over small alphabets
• Discontinuities in pattern inference
• Algorithmic Learning Theory

Cited in

(14)

• Finitely distinguishable erasing pattern languages
• An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
• Erasing pattern languages distinguishable by a finite number of strings
• STACS 2004
• On the equivalence problem for E-pattern languages over small alphabets
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• The equivalence problem of E-pattern languages with length constraints is undecidable
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• A non-learnable class of E-pattern languages
• Learning of erasing primitive formal systems from positive examples
• Learning a subclass of regular patterns in polynomial time
• Developments from enquiries into the learnability of the pattern languages from positive data
• Discontinuities in pattern inference
• Learning indexed families of recursive languages from positive data: A survey

This page was built for publication: On the learnability of e-pattern languages over small alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680873)