Efficient learning of typical finite automata from random walks

Recommendations

Cites work

A theory of the learnable
Biased random walks
Complexity of automaton identification from given data
Computational limitations on learning from examples
Cryptographic limitations on learning Boolean formulae and finite automata
Diversity-based inference of finite automata
Generating quasi-random sequences from semi-random sources
scientific article; zbMATH DE number 3427224 (Why is no real title available?)
scientific article; zbMATH DE number 3928174 (Why is no real title available?)
scientific article; zbMATH DE number 3249395 (Why is no real title available?)
scientific article; zbMATH DE number 3337678 (Why is no real title available?)
Inference of finite automata using homing sequences
Learning regular sets from queries and counterexamples
New approximation algorithms for graph coloring
On the complexity of minimum inference of regular sets
On the learnability of discrete distributions
Predicting \(\{ 0,1\}\)-functions on randomly drawn points
Prediction-preserving reducibility
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
System identification via state characterization
The minimum consistent DFA problem cannot be approximated within any polynomial
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Universal prediction of individual sequences

Cited in

(27)

Learning automata from ordered examples
Learning probabilistic automata and Markov chains via queries
The power of a pebble: Exploring and mapping directed graphs
Exploiting random walks for learning
Learning fallible deterministic finite automata
Weighted automata are compact and actively learnable
Learning Moore machines from input-output traces
Inference of finite automata using homing sequences
Locality and checkability in wait-free computing
Learning a Random DFA from Uniform Strings and State Information
Natural language processing, moving from rules to data
Locality and checkability in wait-free computing
scientific article; zbMATH DE number 1804126 (Why is no real title available?)
Identification of automata by sequential learning
Efficient learning of real time two-counter automata
Learning deterministic finite automata from interleaved strings
CGE: a sequential learning algorithm for Mealy automata
Learning finite automata using label queries
Diversity-based inference of finite automata
Active learning of nondeterministic finite state machines
Simple and fast algorithms for interactive machine learning with random counter-examples
Learning the language of software errors
Approximate learning of limit-average automata
On the meeting of random walks on random DFA
L^*-based learning of Markov decision processes
The power of amnesia: Learning probabilistic automata with variable memory length
Learning commutative deterministic finite state automata in polynomial time

This page was built for publication: Efficient learning of typical finite automata from random walks