Pages that link to "Item:Q1098326"
From MaRDI portal
The following pages link to Learning regular sets from queries and counterexamples (Q1098326):
Displaying 50 items.
- Structural reconfiguration of systems under behavioral adaptation (Q1951614) (← links)
- Wrapper induction: Efficiency and expressiveness (Q1978784) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Active learning of timed automata with unobservable resets (Q1996023) (← links)
- Fundamental results for learning deterministic extended finite state machines from queries (Q1998871) (← links)
- Probabilistic black-box reachability checking (extended version) (Q2008284) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- FSM inference from long traces (Q2024336) (← links)
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability (Q2026298) (← links)
- Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
- Weighted automata are compact and actively learnable (Q2032169) (← links)
- Synthesizing context-free grammars from recurrent neural networks (Q2044212) (← links)
- Inferring switched nonlinear dynamical systems (Q2050095) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- Approximate minimization of weighted tree automata (Q2064525) (← links)
- Learning algorithms (Q2074213) (← links)
- A categorical framework for learning generalised tree automata (Q2104477) (← links)
- Survey on mining signal temporal logic specifications (Q2105443) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Property-directed verification and robustness certification of recurrent neural networks (Q2147216) (← links)
- Satisfiability and synthesis modulo oracles (Q2152655) (← links)
- A modal logic for supervised learning (Q2155207) (← links)
- Learning finite state models from recurrent neural networks (Q2165516) (← links)
- Minimal consistent DFA from sample strings (Q2182675) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Learning weighted automata over principal ideal domains (Q2200852) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Learning pomset automata (Q2233430) (← links)
- Compositional model checking for multi-properties (Q2234059) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- The complexity of exact learning of acyclic conditional preference networks from swap examples (Q2289025) (← links)
- The power of random counterexamples (Q2290678) (← links)
- Efficient active automata learning via mutation testing (Q2331082) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- Inference of finite automata using homing sequences (Q2365762) (← links)
- Learning tree languages from positive examples and membership queries (Q2381576) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Active learning for logistic regression: an evaluation (Q2384165) (← links)
- On the regularity and learnability of ordered DAG languages (Q2399247) (← links)
- Intrinsic complexity of partial learning (Q2419119) (← links)
- Real time identification of discrete event systems using Petri nets (Q2440714) (← links)
- Learning attribute-efficiently with corrupt oracles (Q2465035) (← links)
- Inference of regular languages using state merging algorithms with search (Q2485087) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- Learning languages from positive data and a finite number of queries (Q2490120) (← links)
- An efficient query learning algorithm for ordered binary decision diagrams (Q2568438) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
