Learning Theory

DOI10.1007/B98522zbMATH Open1078.68047OpenAlexW4206057230MaRDI QIDQ4680920FDOQ4680920

Authors: François Denis, Yann Esposito 

Publication date: 13 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98522

Recommendations

• scientific article; zbMATH DE number 2019596
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 2038730
• scientific article; zbMATH DE number 5957212
• Learning Rational Stochastic Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (24)

• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• Title not available (Why is that?)
• Learning probabilistic automata using residuals
• Learning Rational Stochastic Tree Languages
• Title not available (Why is that?)
• Grammatical Inference: Algorithms and Applications
• Implementation and Application of Automata
• On the learnability and usage of acyclic probabilistic finite automata
• Title not available (Why is that?)
• Abductive learning of quantized stochastic processes with probabilistic finite automata
• Links between multiplicity automata, observable operator models and predictive state representations -- a unified learning framework
• Title not available (Why is that?)
• Computation of moments for probabilistic finite-state automata
• Learning Rational Stochastic Languages
• Algorithmic Learning Theory
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Learning probability distributions generated by finite-state machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• On conditional optimality of a class of learning automata in random environments
• Learning probabilistic automata: a study in state distinguishability
• Efficient learning of typical finite automata from random walks
• Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference

This page was built for publication: Learning Theory

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