On the complexity of minimum inference of regular sets

Cited In (33)

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

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)