Learning deterministic regular grammars from stochastic samples in polynomial time
From MaRDI portal
Publication:4256139
DOI10.1051/ita:1999102zbMath0940.68071OpenAlexW2082863623MaRDI QIDQ4256139
Jose Oncina, Rafael C. Carrasco
Publication date: 19 July 2000
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_1999__33_1_1_0/
Related Items (9)
Computing the relative entropy between regular tree languages ⋮ Learning deterministic context free grammars: the Omphalos competition ⋮ Active model learning of stochastic reactive systems ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms ⋮ A language measure for performance evaluation of discrete-event supervisory control systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the learnability and usage of acyclic probabilistic finite automata
- Inference of Finite-State Probabilistic Grammars
- On the inference of stochastic regular grammars
- Probability Inequalities for Sums of Bounded Random Variables
- Language identification in the limit
This page was built for publication: Learning deterministic regular grammars from stochastic samples in polynomial time
