Polynomial inference of universal automata from membership and equivalence queries
From MaRDI portal
(Redirected from Publication:899316)
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
- scientific article; zbMATH DE number 2080668 (Why is no real title available?)
- A geometrical view of the determinization and minimization of finite-state automata
- A learnable representation for syntax using residuated lattices
- Automatic learners with feedback queries
- Characteristic sets for polynomial grammatical inference
- Complexity of automaton identification from given data
- Distributional learning of some context-free languages with a minimally adequate teacher
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings
- Inference of Reversible Languages
- Language identification in the limit
- Learning algebraic structures from text
- Learning context free grammars with the syntactic concept lattice
- Learning regular sets from queries and counterexamples
- On a Maximal NFA Without Mergible States
- The universal automaton
- 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.
- Towards General Algorithms for Grammatical Inference
- Universal automata and NFA learning
Cited in
(10)- Learning language intersections
- Learning finite cover automata from queries
- MAT learning of universal automata
- scientific article; zbMATH DE number 1796949 (Why is no real title available?)
- Regular inference as vertex coloring
- Generalizing over several learning settings
- Automatic learning from positive data and negative counterexamples
- Unambiguous automata inference by means of state-merging methods.
- On the regularity and learnability of ordered DAG languages
- Four one-shot learners for regular tree languages and their polynomial characterizability
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)
