Learning regular sets from queries and counterexamples
From MaRDI portal
Publication:1098326
DOI10.1016/0890-5401(87)90052-6zbMath0636.68112OpenAlexW1989445634WikidataQ56620637 ScholiaQ56620637MaRDI QIDQ1098326
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90052-6
Related Items (only showing first 100 items - show all)
Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Assume, Guarantee or Repair ⋮ Learning One-Clock Timed Automata ⋮ Improving Symbolic Automata Learning with Concolic Execution ⋮ On the hardness of approximating the minimum consistent OBDD problem ⋮ Unnamed Item ⋮ On the complexity of small description and related topics ⋮ Unnamed Item ⋮ Regular model checking revisited ⋮ Never-stop context-free learning ⋮ Active model learning of stochastic reactive systems ⋮ Grammatical inference: An old and new paradigm ⋮ Efficient learning of real time one-counter automata ⋮ Language learning from membership queries and characteristic examples ⋮ Learning reward machines: a study in partially observable reinforcement learning ⋮ Learning ordered binary decision diagrams ⋮ Simple PAC learning of simple decision lists ⋮ Compositional learning for interleaving parallel automata ⋮ On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words ⋮ Active automata learning as black-box search and lazy partition refinement ⋮ Learning language intersections ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ Automated program repair using formal verification techniques ⋮ Unnamed Item ⋮ Inferring Symbolic Automata ⋮ Learning picture sets from examples ⋮ Learning quantum finite automata with queries ⋮ Weighted automata extraction and explanation of recurrent neural networks for natural language tasks ⋮ Enhancing active model learning with equivalence checking using simulation relations ⋮ Learning deterministic one-clock timed automata via mutation testing ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Learning and characterizing fully-ordered lattice automata ⋮ A model learning based testing approach for kernel P systems ⋮ A survey of model learning techniques for recurrent neural networks ⋮ From languages to behaviors and back ⋮ Passive automata learning: DFAs and NFAs ⋮ Boosting robustness verification of semantic feature neighborhoods ⋮ A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fingerprinting and analysis of Bluetooth devices with automata learning ⋮ Tree-Based Generation of Restricted Graph Languages ⋮ Unnamed Item ⋮ Learning context-free grammars from positive data and membership queries ⋮ Synthesis of hybrid automata with affine dynamics from time-series data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Almost Optimal Testers for Concise Representations. ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ Two-Sided Strictly Locally Testable Languages ⋮ Learning Transparent Data Automata ⋮ Automata Learning: A Categorical Perspective ⋮ Complexity of automatic sequences ⋮ Compositional CSP Traces Refinement Checking ⋮ Robust learning with infinite additional information ⋮ Query learning of bounded-width OBDDs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning Mealy machines with one timer ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages ⋮ Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference ⋮ The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx ⋮ VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states ⋮ DERANDOMIZED LEARNING OF BOOLEAN FUNCTIONS OVER FINITE ABELIAN GROUPS ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning ⋮ A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants ⋮ Learning with queries inside the class of unate \(k\)-quasi-Horn formulas ⋮ Learning an extension of the class of functional dependencies with queries ⋮ An algorithm to learn read-once threshold formulas, and transformations between learning models ⋮ Learning elementary formal systems with queries. ⋮ Polynomial-time identification of very simple grammars from positive data. ⋮ DKL: an efficient algorithm for learning deterministic Kripke structures ⋮ Prefix grammars: An alternative characterization of the regular languages ⋮ The query complexity of learning DFA ⋮ Scalable polyhedral verification of recurrent neural networks ⋮ Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ Active learning of sequential transducers with side information about the domain ⋮ Towards refinement of abductive or inductive hypotheses through propagation ⋮ Learning nearly monotone \(k\)-term DNF ⋮ PACS, simple-PAC and query learning ⋮ The learnability of description logics with equality constraints ⋮ A note on the construction of marked graphs ⋮ Testing nonlinear operators ⋮ VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states ⋮ Learning fallible deterministic finite automata ⋮ Learning regular omega languages ⋮ Inferring regular languages and \(\omega\)-languages ⋮ On the learnability of vector spaces ⋮ Grammatical inference for even linear languages based on control sets ⋮ Efficient learning of typical finite automata from random walks ⋮ Paradigms of truth detection ⋮ Learning intersections and thresholds of halfspaces ⋮ Using relevance queries for identification of read-once functions ⋮ Learning of event-recording automata
Cites Work
This page was built for publication: Learning regular sets from queries and counterexamples
