On the complexity of minimum inference of regular sets

Cited in

(35)

Identification of pattern languages from examples and queries
Two notions of correctness and their relation to testing
IIPS: A framework for specifying inductive-inference problems
Inferring a tree from walks
Efficient learning of typical finite automata from random walks
Map learning with uninterpreted sensors and effectors
Inference of -languages from prefixes.
On the complexity of automatic complexity
Learning from positive and negative examples: dichotomies and parameterized algorithms
Minimal consistent DFA from sample strings
A multi-parameter analysis of hard problems on deterministic finite automata
A sufficient condition to polynomially compute a minimum separating DFA
Learning context-free grammars using tabular representations
Inference of regular languages using state merging algorithms with search
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
Learning weighted automata
Learning grammars and automata with queries
On the Inference of Finite State Automata from Positive and Negative Data
Minimal consistent DFA revisited
Types of trusted information that make DFA identification with correction queries feasible
Inductive inference of context-free languages based on context-free expressions
Model-based learning of interaction strategies in multi-agent systems
Regular inference as vertex coloring
On the hardness of approximating the minimum consistent OBDD problem
Learning definable hypotheses on trees
Inferring a tree from walks
A natural encoding scheme proved probabilistic polynomial complete
Learning from positive and negative examples: new proof for binary alphabets
A framework for computing upper bounds in passive learning settings
Learning deterministic multi-clock timed automata
Uniquely decodable n-gram embeddings
Title not available (Why is no real title available?)
Prediction-preserving reducibility
Towards a general theory of topological maps
Kernel methods for learning languages

This page was built for publication: On the complexity of minimum inference of regular sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174776)