Pages that link to "Item:Q2365762"

The following pages link to Inference of finite automata using homing sequences (Q2365762):

Displaying 50 items.

• Learning finite cover automata from queries (Q414872) (← links)
• Active learning of nondeterministic finite state machines (Q459826) (← links)
• A succinct canonical register automaton model (Q478388) (← links)
• Learning register automata: from languages to program structures (Q479461) (← links)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition (Q479466) (← links)
• Learning of event-recording automata (Q604474) (← links)
• Classic learning (Q676240) (← links)
• Active learning for extended finite state machines (Q736459) (← links)
• Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
• New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158) (← links)
• AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee (Q848309) (← links)
• Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
• Verification of evolving software via component substitutability analysis (Q934712) (← links)
• Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
• Selection of relevant features and examples in machine learning (Q1127357) (← links)
• Efficient learning of typical finite automata from random walks (Q1373138) (← links)
• A simple algorithm for learning O(log n)-term DNF (Q1392215) (← links)
• Map learning with uninterpreted sensors and effectors (Q1402736) (← links)
• Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
• Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
• Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
• The query complexity of finding local minima in the lattice (Q1854471) (← links)
• Learning to win process-control games watching game-masters (Q1854518) (← links)
• The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
• Learning fallible deterministic finite automata (Q1900974) (← links)
• \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
• Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
• Learning Mealy machines with one timer (Q2232274) (← links)
• Efficient active automata learning via mutation testing (Q2331082) (← links)
• An efficient query learning algorithm for ordered binary decision diagrams (Q2568438) (← links)
• Learning to verify branching time properties (Q2642669) (← links)
• Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
• Enhancing Automata Learning by Log-Based Metrics (Q2814131) (← links)
• Inferring Canonical Register Automata (Q2891417) (← links)
• Learning Grammars and Automata with Queries (Q2963594) (← links)
• Automata Learning with Automated Alphabet Abstraction Refinement (Q3075487) (← links)
• Compositional Reasoning (Q3176370) (← links)
• A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees (Q3303894) (← links)
• AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES (Q3395145) (← links)
• The Birth of Model Checking (Q3512430) (← links)
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
• Grey-Box Checking (Q3613088) (← links)
• Learning Minimal Separating DFA’s for Compositional Verification (Q3617752) (← links)
• Model-based learning of interaction strategies in multi-agent systems (Q4421289) (← links)
• (Q5020531) (← links)
• Compositional CSP Traces Refinement Checking (Q5178982) (← links)
• A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants (Q5257774) (← links)
• A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
• Fingerprinting and analysis of Bluetooth devices with automata learning (Q6185823) (← links)