Pages that link to "Item:Q1098326"

The following pages link to Learning regular sets from queries and counterexamples (Q1098326):

Displaying 50 items.

• Automated assumption generation for compositional verification (Q934710) (← links)
• Verification of evolving software via component substitutability analysis (Q934712) (← links)
• Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
• Models of active learning in group-structured state spaces (Q963065) (← links)
• A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor (Q965813) (← links)
• Parameterized learnability of juntas (Q1034613) (← links)
• Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
• Minimizing deterministic weighted tree automata (Q1041045) (← links)
• Limitations of learning in automata-based systems (Q1046075) (← links)
• Grammatical inference for even linear languages based on control sets (Q1111403) (← links)
• Paradigms of truth detection (Q1117917) (← links)
• Selection of relevant features and examples in machine learning (Q1127357) (← links)
• Learning regular languages from counterexamples (Q1176104) (← links)
• Learning elementary formal systems (Q1186429) (← links)
• Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
• Learning via queries and oracles (Q1295409) (← links)
• Synthesis of real time acceptors (Q1322856) (← links)
• An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
• Prefix grammars: An alternative characterization of the regular languages (Q1332773) (← links)
• The query complexity of learning DFA (Q1336037) (← links)
• The learnability of description logics with equality constraints (Q1342732) (← links)
• A note on the construction of marked graphs (Q1350366) (← links)
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
• Efficient learning of typical finite automata from random walks (Q1373138) (← links)
• Recent advances of grammatical inference (Q1390941) (← links)
• A simple algorithm for learning O(log n)-term DNF (Q1392215) (← links)
• Identification of function distinguishable languages. (Q1401186) (← links)
• Map learning with uninterpreted sensors and effectors (Q1402736) (← links)
• Learning regular languages using RFSAs. (Q1426151) (← links)
• Learning by switching type of information. (Q1427864) (← links)
• Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
• Automated circular assume-guarantee reasoning (Q1673656) (← links)
• A theory of formal synthesis via inductive learning (Q1674868) (← links)
• Learning deterministic probabilistic automata from a model checking perspective (Q1689574) (← links)
• Verification of asynchronous systems with an unspecified component (Q1731830) (← links)
• Learnability of automatic classes (Q1757849) (← links)
• Enforcement of opacity by public and private insertion functions (Q1797032) (← links)
• Coalgebraic logics \& duality (Q1798781) (← links)
• The consistency dimension and distribution-dependent learning from queries. (Q1853513) (← links)
• Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
• Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
• Improved lower bounds for learning from noisy examples: An information-theoretic approach (Q1854425) (← links)
• The query complexity of finding local minima in the lattice (Q1854471) (← links)
• The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
• Learning elementary formal systems with queries. (Q1874227) (← links)
• Polynomial-time identification of very simple grammars from positive data. (Q1874233) (← links)
• On the learnability of infinitary regular sets (Q1892893) (← links)
• Testing nonlinear operators (Q1895875) (← links)
• Learning fallible deterministic finite automata (Q1900974) (← links)
• Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948) (← links)