On the complexity of minimum inference of regular sets
From MaRDI portal
Publication:4174776
Cited in
(32)- Regular inference as vertex coloring
- Inference of regular languages using state merging algorithms with search
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
- A sufficient condition to polynomially compute a minimum separating DFA
- Learning weighted automata
- Map learning with uninterpreted sensors and effectors
- On the Inference of Finite State Automata from Positive and Negative Data
- Identification of pattern languages from examples and queries
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- On the complexity of automatic complexity
- Inference of \(\omega\)-languages from prefixes.
- Inferring a tree from walks
- Efficient learning of typical finite automata from random walks
- Kernel methods for learning languages
- Model-based learning of interaction strategies in multi-agent systems
- Learning grammars and automata with queries
- Learning context-free grammars using tabular representations
- Towards a general theory of topological maps
- Types of trusted information that make DFA identification with correction queries feasible
- Inferring a tree from walks
- A natural encoding scheme proved probabilistic polynomial complete
- On the hardness of approximating the minimum consistent OBDD problem
- Minimal consistent DFA revisited
- Two notions of correctness and their relation to testing
- Uniquely decodable \(n\)-gram embeddings
- IIPS: A framework for specifying inductive-inference problems
- A multi-parameter analysis of hard problems on deterministic finite automata
- scientific article; zbMATH DE number 7561484 (Why is no real title available?)
- Learning from positive and negative examples: new proof for binary alphabets
- Minimal consistent DFA from sample strings
- Inductive inference of context-free languages based on context-free expressions
- 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)