Efficient learning of typical finite automata from random walks.
Yoav FreundMichael J. KearnsDana RonRonitt RubinfeldRobert E. SchapireLinda SelliePublished in: STOC (1993)
Keyphrases
- random walk
- efficient learning
- finite automata
- regular expressions
- grammatical inference
- deterministic automata
- markov chain
- directed graph
- tree automata
- hidden markov models
- stationary distribution
- learning algorithm
- markov random walk
- spectral methods
- finite automaton
- transition probability matrix
- data model
- data analysis
- databases