Erasing Pattern Languages Distinguishable by a Finite Number of Strings

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on Algorithmic Learning Theory

• Publication date

  2017-10-11

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distinguishing pattern languages with membership examples

  2017influential reference
• Classifying the Arithmetical Complexity of Teaching Models

  2016cited by this paper
• Preference-based Teaching

  2016cited by this paper
• On the Teaching Complexity of Linear Sets

  2015influential reference
• Pattern matching with variables: A multivariate complexity analysis

  2013cited by this paper
• Regular and context-free pattern languages over small alphabets

  2012influential reference
• Regular patterns, regular languages and context-free languages

  2010influential reference
• Bad News on Decision Problems for Patterns

  2008cited by this paper
• A non-learnable class of E-pattern languages

  2006cited by this paper
• Learning erasing pattern languages with queries

  2005influential reference
• Approaches to the Automatic Discovery of Patterns in Biosequences

  1998cited by this paper
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

  1997cited by this paper
• On the Equivalence Problem for E-Pattern Languages

  1996cited by this paper
• Teaching a Smarter Learner

  1996cited by this paper
• Sample compression, learnability, and the Vapnik-Chervonenkis dimension

  1995cited by this paper
• Decision Problems for Patterns

  1995cited by this paper
• Pattern languages with and without erasing

  1994influential reference
• On the complexity of teaching

  1991influential reference
• Polynomial-Time Inference of Pattern Languages

  1990influential reference
• Teachability in computational learning

  1990influential reference
• Polynomial Time Inference of Extended Regular Pattern Languages

  1983influential reference
• Finding Patterns Common to a Set of Strings

  1980influential reference
• Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities

  1971cited by this paper
• Journal of Machine Learning Research x (2011) xx-xx Submitted 6/10; Revised 12/10; Published x/11 Models of Cooperative Teaching and Learning

  year unknowncited by this paper

• The teaching complexity of erasing pattern languages with bounded variable frequency

  2019cites this paper