Learning deterministic regular grammars from stochastic samples in polynomial time

DOI10.1051/ITA:1999102MaRDI QIDQ4256139zbMATH OpenOpenAlexFDO

Authors Rafael C. Carrasco, Jose Oncina

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/, https://eudml.org/doc/221999

zbMATH Keywords

stochastic regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Grammatical Inference: Algorithms and Applications
• Identification with probability one of stochastic deterministic linear languages
• Stochastic inference of regular tree languages
• Grammatical Inference: Algorithms and Applications
• Learning regular sets from queries and counterexamples

Cites work

• scientific article; zbMATH DE number 3825216 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Inference of Finite-State Probabilistic Grammars
• Language identification in the limit
• On the inference of stochastic regular grammars
• On the learnability and usage of acyclic probabilistic finite automata
• Probability Inequalities for Sums of Bounded Random Variables

Cited in

(19)

• Learning deterministic probabilistic automata from a model checking perspective
• A language measure for performance evaluation of discrete-event supervisory control systems
• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Learning deterministic context free grammars: the Omphalos competition
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• scientific article; zbMATH DE number 1670719 (Why is no real title available?)
• scientific article; zbMATH DE number 1728794 (Why is no real title available?)
• Computing the relative entropy between regular tree languages
• Learning probability distributions generated by finite-state machines
• scientific article; zbMATH DE number 4133518 (Why is no real title available?)
• scientific article; zbMATH DE number 2019606 (Why is no real title available?)
• Adaptively learning probabilistic deterministic automata from data streams
• Maximum likelihood estimation of factored regular deterministic stochastic languages
• Grammatical Inference: Algorithms and Applications
• Identification with probability one of stochastic deterministic linear languages
• Stochastic inference of regular tree languages
• Active model learning of stochastic reactive systems
• L^*-based learning of Markov decision processes
• Learning context-free grammars from structural data in polynomial time

This page was built for publication: Learning deterministic regular grammars from stochastic samples in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256139)