Polynomial inference of universal automata from membership and equivalence queries (Q899316): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2015.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2182777485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic learners with feedback queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards General Algorithms for Grammatical Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Context Free Grammars with the Syntactic Concept Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Learnable Representation for Syntax Using Residuated Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometrical view of the determinization and minimization of finite-state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic sets for polynomial grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal automata and NFA learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Maximal NFA Without Mergible States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four one-shot learners for regular tree languages and their polynomial characterizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical inference: Theoretical results and applications. 10th international colloquium, ICGI 2010, Valencia, Spain, September 13--16, 2010. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning algebraic structures from text / rank
 
Normal rank

Latest revision as of 05:55, 11 July 2024

scientific article
Language Label Description Also known as
English
Polynomial inference of universal automata from membership and equivalence queries
scientific article

    Statements

    Polynomial inference of universal automata from membership and equivalence queries (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2015
    0 references
    query learning
    0 references
    universal finite automata
    0 references
    observation tables
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers