Finitely distinguishable erasing pattern languages
From MaRDI portal
Publication:2290682
DOI10.1016/j.tcs.2019.11.011zbMath1436.68159OpenAlexW2984492834MaRDI QIDQ2290682
Sandra Zilles, Ziyuan Gao, Fahimeh Bayeh
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular and context-free pattern languages over small alphabets
- Teachability in computational learning
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- Teaching a smarter learner.
- Bad news on decision problems for patterns
- Finding patterns common to a set of strings
- On the equivalence problem for E-pattern languages
- Regular patterns, regular languages and context-free languages
- On the teaching complexity of linear sets
- On the complexity of teaching
- Decision problems for patterns
- Pattern matching with variables: a multivariate complexity analysis
- Distinguishing pattern languages with membership examples
- Learning erasing pattern languages with queries
- Classifying the Arithmetical Complexity of Teaching Models
- Pattern languages with and without erasing
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Bounded Regular Sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
This page was built for publication: Finitely distinguishable erasing pattern languages