Four one-shot learners for regular tree languages and their polynomial characterizability
From MaRDI portal
Publication:388793
DOI10.1016/j.tcs.2013.01.003zbMath1292.68098OpenAlexW2065003734MaRDI QIDQ388793
Publication date: 7 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.003
grammatical inferencequery learninglearning from finite samplesone-shot learningpolynomial characterizability
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)
Related Items (2)
Polynomial inference of universal automata from membership and equivalence queries ⋮ Learning Tree Languages
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MAT learners for tree series: an abstract data type and two realizations
- Query learning of regular tree languages: How to avoid dead states
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Characteristic sets for polynomial grammatical inference
- On the learnability of infinitary regular sets
- Queries and concept learning
- Learning tree languages from positive examples and membership queries
- Formal language identification: query learning vs. gold-style learning
- Relations between Gold-style learning and query learning
- Distributional Learning of Simple Context-Free Tree Grammars
- Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
- Learning Context Free Grammars with the Syntactic Concept Lattice
- Complexity of automaton identification from given data
- A note on the number of queries needed to identify regular languages
- Towards General Algorithms for Grammatical Inference
- Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
- Language identification in the limit
This page was built for publication: Four one-shot learners for regular tree languages and their polynomial characterizability
