Polynomial inference of universal automata from membership and equivalence queries
From MaRDI portal
Publication:899316
DOI10.1016/j.ic.2015.11.005zbMath1333.68153OpenAlexW2182777485MaRDI QIDQ899316
Johanna Björklund, Henning Fernau, Anna Kasprzik
Publication date: 28 December 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.11.005
Related Items
On the regularity and learnability of ordered DAG languages, Automatic learning from positive data and negative counterexamples
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Universal automata and NFA learning
- Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings
- Learning regular sets from queries and counterexamples
- Characteristic sets for polynomial grammatical inference
- Tools and algorithms for the construction and analysis of systems. 17th international conference, TACAS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 -- April 3, 2011. Proceedings
- Automatic learners with feedback queries
- A Learnable Representation for Syntax Using Residuated Lattices
- A geometrical view of the determinization and minimization of finite-state automata
- On a Maximal NFA Without Mergible States
- Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
- Learning Context Free Grammars with the Syntactic Concept Lattice
- Inference of Reversible Languages
- Complexity of automaton identification from given data
- Towards General Algorithms for Grammatical Inference
- Language identification in the limit
- Learning algebraic structures from text
