Learning from positive and negative examples: dichotomies and parameterized algorithms
From MaRDI portal
Publication:2169975
Cites work
- A multi-parameter analysis of hard problems on deterministic finite automata
- Algorithms for learning regular expressions from positive data
- Alternative automata characterization of piecewise testable languages
- Complexity of automaton identification from given data
- Complexity of decision problems for XML schemas and chain regular expressions
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Fundamentals of parameterized complexity
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 2080060 (Why is no real title available?)
- scientific article; zbMATH DE number 3284302 (Why is no real title available?)
- Inference of Reversible Languages
- Language identification in the limit
- Languages of R-trivial monoids
- Learning automata and stochastic optimization
- Learning deterministic probabilistic automata from a model checking perspective
- Learning DFA from simple examples
- Lower bounds based on the exponential time hypothesis
- On finite monoids having only trivial subgroups
- On the complexity of k-SAT
- On the complexity of minimum inference of regular sets
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- Optimization technique based on learning automata
- Parameterized algorithms
- Permutation automata
- Problems on finite automata and the exponential time hypothesis
- Recent advances in learning automata
- Supervisory Control of a Class of Discrete Event Processes
- The complexity of satisfiability problems
- The minimum consistent DFA problem cannot be approximated within any polynomial
- Using forward reachability analysis for verification of lossy channel systems
- Which problems have strongly exponential complexity?
Cited in
(5)- One-shot learners using negative counterexamples and nearest positive examples
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples
- Iterative learning from positive data and negative counterexamples
- Learning from Positive Data and Negative Counterexamples: A Survey
- An iterative algorithm to learn from positive and unlabeled examples
This page was built for publication: Learning from positive and negative examples: dichotomies and parameterized algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169975)
