Pages that link to "Item:Q4153610"
From MaRDI portal
The following pages link to Complexity of automaton identification from given data (Q4153610):
Displaying 50 items.
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- The power of random counterexamples (Q2290678) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- Recognizing malicious software behaviors with tree automata inference (Q2441717) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Identification of Petri nets from knowledge of their language (Q2465425) (← links)
- Learning context-free grammars using tabular representations (Q2485075) (← links)
- Inference of regular languages using state merging algorithms with search (Q2485087) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- PAC learning under helpful distributions (Q2771492) (← links)
- Parameterized Weighted Containment (Q2946752) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- On the Inference of Finite State Automata from Positive and Negative Data (Q2963595) (← links)
- Learning Tree Languages (Q2963598) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (Q3073646) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Learning Meets Verification (Q3525110) (← links)
- Learning Stochastic Logical Automaton (Q3617033) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (Q3618628) (← links)
- Inductive inference of context-free languages based on context-free expressions (Q3806846) (← links)
- Model-based learning of interaction strategies in multi-agent systems (Q4421289) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference (Q4989176) (← links)
- A Survey of Opponent Modeling in Adversarial Domains (Q5026260) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5091140) (← links)
- Inferring a tree from walks (Q5096851) (← links)
- Polynomial Identification of $$\omega $$-Automata (Q5164178) (← links)
- On Testing P Systems (Q5191169) (← links)
- Induction and Exploitation of Subgoal Automata for Reinforcement Learning (Q5856492) (← links)
- Recognizing Generating Subgraphs Revisited (Q5859675) (← links)
- On the Computational Complexity of Linear Discrepancy (Q5874541) (← links)
- (Q5875378) (← links)
- Learning of Structurally Unambiguous Probabilistic Grammars (Q5883734) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Learning from positive and negative examples: new proof for binary alphabets (Q6072211) (← links)
- Learning reward machines: a study in partially observable reinforcement learning (Q6080653) (← links)
