Pages that link to "Item:Q4174776"
From MaRDI portal
The following pages link to On the complexity of minimum inference of regular sets (Q4174776):
Displayed 33 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Towards a general theory of topological maps (Q814534) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Identification of pattern languages from examples and queries (Q1097709) (← links)
- Two notions of correctness and their relation to testing (Q1161275) (← links)
- IIPS: A framework for specifying inductive-inference problems (Q1206224) (← links)
- Inferring a tree from walks (Q1351963) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Map learning with uninterpreted sensors and effectors (Q1402736) (← links)
- Inference of \(\omega\)-languages from prefixes. (Q1426153) (← links)
- On the complexity of automatic complexity (Q1694011) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Minimal consistent DFA from sample strings (Q2182675) (← 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)
- Learning context-free grammars using tabular representations (Q2485075) (← links)
- Inference of regular languages using state merging algorithms with search (Q2485087) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- The Complexity of Fixed-Height Patterned Tile Self-assembly (Q2830225) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Learning Grammars and Automata with Queries (Q2963594) (← links)
- On the Inference of Finite State Automata from Positive and Negative Data (Q2963595) (← links)
- Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (Q3073646) (← 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)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- (Q5091140) (← links)
- Inferring a tree from walks (Q5096851) (← links)
- Learning from positive and negative examples: new proof for binary alphabets (Q6072211) (← links)