PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (Q2465033): Difference between revisions

@@ Property / cites work @@
+On the computational complexity of approximating distributions by probabilistic automata
+Normal rank
@@ Property / cites work @@
+Neural Network Learning
@@ Property / cites work: Neural Network Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3093192
@@ Property / cites work: Q3093192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
+Normal rank
@@ Property / cites work @@
+Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
+Normal rank
@@ Property / cites work @@
+Q3093345
@@ Property / cites work: Q3093345 / rank @@
+Normal rank
@@ Property / cites work @@
+Grammatical Inference: Algorithms and Applications
+Normal rank
@@ Property / cites work @@
+On the learnability of discrete distributions
@@ Property / cites work: On the learnability of discrete distributions / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Learning Theory
@@ Property / cites work: Algorithmic Learning Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the learnability and usage of acyclic probabilistic finite automata
+Normal rank