A note on the number of queries needed to identify regular languages
From MaRDI portal
Publication:4741718
DOI10.1016/S0019-9958(81)90090-5zbMath0504.68050WikidataQ59595144 ScholiaQ59595144MaRDI QIDQ4741718
Publication date: 1981
Published in: Information and Control (Search for Journal in Brave)
Related Items (22)
DKL: an efficient algorithm for learning deterministic Kripke structures ⋮ Identification of pattern languages from examples and queries ⋮ Learning regular sets from queries and counterexamples ⋮ Learning tree languages from positive examples and membership queries ⋮ Learning fallible deterministic finite automata ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Language learning from membership queries and characteristic examples ⋮ Inferring Symbolic Automata ⋮ Learning picture sets from examples ⋮ On the meeting of random walks on random DFA ⋮ Learning Grammars and Automata with Queries ⋮ Learning context-free grammars from positive data and membership queries ⋮ Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries ⋮ Learning regular languages from counterexamples ⋮ Incremental Learning-Based Testing for Reactive Systems ⋮ Learning context-free grammars using tabular representations ⋮ Polynomial time learning of simple deterministic languages via queries and a representative sample ⋮ Types of Trusted Information That Make DFA Identification with Correction Queries Feasible ⋮ Learning Finite Automata Using Label Queries
This page was built for publication: A note on the number of queries needed to identify regular languages
