The VC-dimension of subclasses of pattern languages

DOI10.1007/3-540-46769-6_8MaRDI QIDQ4955303zbMATH OpenFDO

Authors Andrew J. Mitchell, Tobias Scheffer, Frank Stephan, Andrew Mitchell, Arun Sharma

Publication date 25 May 2000

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

Full work available at URL https://doi.org/10.1007/3-540-46769-6_8

zbMATH Keywords

pattern languagesVapnik Chervonenkis dimension

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Learning Subclasses of Pure Pattern Languages
• VC-dimensions of short Presburger formulas
• scientific article; zbMATH DE number 522839
• On the complexity of constrained VC-classes
• Finite degrees of ambiguity in pattern languages
• scientific article; zbMATH DE number 996382
• A Language of Patterns for Subterm Selection
• Automatic learning of subclasses of pattern languages
• Automatic learning of subclasses of pattern languages
• scientific article; zbMATH DE number 517032

Cited in

(6)

• An average-case optimal one-variable pattern language learner
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• VC-dimensions of short Presburger formulas
• The VC-dimensions of finite automata with n states
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
• From learning in the limit to stochastic finite learning

This page was built for publication: The VC-dimension of subclasses of pattern languages

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