Learning Theory

DOI10.1007/B98522zbMATH Open1078.68649OpenAlexW4206057230MaRDI QIDQ4680873FDOQ4680873

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

Recommendations

• A non-learnable class of E-pattern languages
• STACS 2004
• Developments in Language Theory
• Discontinuities in pattern inference
• Algorithmic Learning Theory

Mathematics Subject Classification ID

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

Cited In (12)

• Learning a subclass of regular patterns in polynomial time
• Developments in Language Theory
• Learning indexed families of recursive languages from positive data: A survey
• Developments from enquiries into the learnability of the pattern languages from positive data
• Learning of erasing primitive formal systems from positive examples
• A non-learnable class of E-pattern languages
• Discontinuities in pattern inference
• Finitely distinguishable erasing pattern languages
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• STACS 2004
• 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

This page was built for publication: Learning Theory

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