Distinguishing pattern languages with membership examples

DOI10.1016/j.ic.2017.08.003zbMath1376.68072OpenAlexW2753140668MaRDI QIDQ2407113

Sandra Zilles, Zeinab Mazadi, Ziyuan Gao, Regan Meloche, Hans Ulrich Simon

Publication date: 28 September 2017

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

Full work available at URL: https://doi.org/10.1016/j.ic.2017.08.003

zbMATH Keywords

computational learning theoryteachingpattern languagesteaching dimensionrecursive teaching dimensionregular pattern languages

Mathematics Subject Classification ID

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

Related Items (2)

On the teaching complexity of linear sets ⋮ Finitely distinguishable erasing pattern languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the parameterised complexity of string morphism problems
• Inferring descriptive generalisations of formal languages
• Regular and context-free pattern languages over small alphabets
• Algebraic methods proving Sauer's bound for teaching complexity
• Patterns with bounded treewidth
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Teachability in computational learning
• Bad news on decision problems for patterns
• Finding patterns common to a set of strings
• A note on orthogonal partitions and some well-known structures in design of experiments
• Regular patterns, regular languages and context-free languages
• On the complexity of teaching
• Queries and concept learning
• Pattern matching with variables: a multivariate complexity analysis
• Polynomial-Time Algorithms for Learning Typed Pattern Languages
• Learning Relational Patterns
• Editing by example
• Order compression schemes

This page was built for publication: Distinguishing pattern languages with membership examples