Pages that link to "Item:Q4033836"
From MaRDI portal
The following pages link to The minimum consistent DFA problem cannot be approximated within any polynomial (Q4033836):
Displayed 27 items.
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- On the necessity of Occam algorithms (Q1193631) (← links)
- Inferring a tree from walks (Q1351963) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Recent advances of grammatical inference (Q1390941) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← 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)
- Incremental learning of context free grammars based on bottom-up parsing and search (Q2485077) (← 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)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Learning a Random DFA from Uniform Strings and State Information (Q2835622) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference (Q4989176) (← links)
- A Survey of Opponent Modeling in Adversarial Domains (Q5026260) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- (Q5875378) (← links)
- Grammatical inference: An old and new paradigm (Q6061882) (← links)
- Learning from positive and negative examples: new proof for binary alphabets (Q6072211) (← links)