Polynomial inference of universal automata from membership and equivalence queries
From MaRDI portal
Publication:899316
DOI10.1016/J.IC.2015.11.005zbMATH Open1333.68153OpenAlexW2182777485MaRDI QIDQ899316FDOQ899316
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1796949
- ON UNIVERSALLY POLYNOMIAL CONTEXT-FREE LANGUAGES
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Polynomial-time inference of arbitrary pattern languages
- Polynomial identification of \(\omega \)-automata
- scientific article; zbMATH DE number 3868655
- A Polynomial Algorithm for the Inference of Context Free Languages
- scientific article; zbMATH DE number 996383
- scientific article; zbMATH DE number 7650821
Cites Work
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Language identification in the limit
- The universal automaton
- Universal automata and NFA learning
- Inference of Reversible Languages
- Complexity of automaton identification from given data
- Characteristic sets for polynomial grammatical inference
- Distributional learning of some context-free languages with a minimally adequate teacher
- Learning context free grammars with the syntactic concept lattice
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Towards General Algorithms for Grammatical Inference
- Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings
- 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
- A geometrical view of the determinization and minimization of finite-state automata
- Learning algebraic structures from text
- Automatic learners with feedback queries
- A learnable representation for syntax using residuated lattices
- On a Maximal NFA Without Mergible States
Cited In (10)
- Learning language intersections
- MAT learning of universal automata
- Learning finite cover automata from queries
- Title not available (Why is that?)
- Generalizing over several learning settings
- Regular inference as vertex coloring
- Unambiguous automata inference by means of state-merging methods.
- Automatic learning from positive data and negative counterexamples
- On the regularity and learnability of ordered DAG languages
- Four one-shot learners for regular tree languages and their polynomial characterizability
Uses Software
This page was built for publication: Polynomial inference of universal automata from membership and equivalence queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899316)
