Finitely distinguishable erasing pattern languages

DOI10.1016/J.TCS.2019.11.011zbMATH Open1436.68159OpenAlexW2984492834MaRDI QIDQ2290682FDOQ2290682

Authors: Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles 

Publication date: 29 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.011

Recommendations

• Erasing pattern languages distinguishable by a finite number of strings
• Distinguishing pattern languages with membership examples
• Learning Theory
• Learning erasing pattern languages with queries
• Distinguishing pattern languages with membership examples

zbMATH Keywords

pattern languagesteaching dimensionrecursive teaching dimension

Mathematics Subject Classification ID

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

Cites Work

• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
• Finding patterns common to a set of strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pattern languages with and without erasing
• A non-learnable class of E-pattern languages
• Discontinuities in pattern inference
• Teaching a smarter learner.
• Bad news on decision problems for patterns
• Regular patterns, regular languages and context-free languages
• Decision problems for patterns
• Pattern matching with variables: a multivariate complexity analysis
• Regular and context-free pattern languages over small alphabets
• Bounded Regular Sets
• On the complexity of teaching
• Models of cooperative teaching and learning
• Teachability in computational learning
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• On the equivalence problem for E-pattern languages
• Learning erasing pattern languages with queries
• Title not available (Why is that?)
• On the teaching complexity of linear sets
• Distinguishing pattern languages with membership examples
• Classifying the arithmetical complexity of teaching models
• Preference-based teaching

Cited In (8)

• Erasing in Petri Net Languages and Matrix Grammars
• Distinguishing pattern languages with membership examples
• Distinguishing pattern languages with membership examples
• Learning erasing pattern languages with queries
• Algorithmic Learning Theory
• On elimination of erasing rules from E0S grammars
• Erasing pattern languages distinguishable by a finite number of strings
• Erasing in context-free AFLs

This page was built for publication: Finitely distinguishable erasing pattern languages

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