Efficient learning of typical finite automata from random walks (Q1373138): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.1997.2648
+Normal rank
@@ Property / OpenAlex ID @@
+W2043635106
@@ Property / OpenAlex ID: W2043635106 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning regular sets from queries and counterexamples
+Normal rank
@@ Property / cites work @@
+On the complexity of minimum inference of regular sets
+Normal rank
@@ Property / cites work @@
+Biased random walks
@@ Property / cites work: Biased random walks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5614667
@@ Property / cites work: Q5614667 / rank @@
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for graph coloring
@@ Property / cites work: New approximation algorithms for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Universal prediction of individual sequences
@@ Property / cites work: Universal prediction of individual sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+System identification via state characterization
@@ Property / cites work: System identification via state characterization / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of automaton identification from given data
+Normal rank
@@ Property / cites work @@
+Predicting \(\{ 0,1\}\)-functions on randomly drawn points
+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 @@
+Cryptographic limitations on learning Boolean formulae and finite automata
+Normal rank
@@ Property / cites work @@
+Computational limitations on learning from examples
+Normal rank
@@ Property / cites work @@
+Prediction-preserving reducibility
@@ Property / cites work: Prediction-preserving reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum consistent DFA problem cannot be approximated within any polynomial
+Normal rank
@@ Property / cites work @@
+Inference of finite automata using homing sequences
+Normal rank
@@ Property / cites work @@
+Diversity-based inference of finite automata
@@ Property / cites work: Diversity-based inference of finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Generating quasi-random sequences from semi-random sources
+Normal rank
@@ Property / cites work @@
+Q3214824
@@ Property / cites work: Q3214824 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / cites work @@
+Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
+Normal rank
@@ Property / cites work @@
+Q3702366
@@ Property / cites work: Q3702366 / rank @@
+Normal rank