Finitely distinguishable erasing pattern languages

DOI10.1016/J.TCS.2019.11.011MaRDI QIDQ2290682zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pattern languagesteaching dimensionrecursive teaching dimension

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

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

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)