Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference

DOI10.1007/11872436_10MaRDI QIDQ3541850zbMATH OpenOpenAlexFDO

Authors Amaury Habrard, François Denis, Yann Esposito

Publication date 27 November 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

multiplicity automataprobabilistic grammatical inferencepseudo-stochastic rational languages

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Learning Rational Stochastic Languages
• Relevant Representations for the Inference of Rational Stochastic Tree Languages
• Learning Theory
• On rational stochastic languages
• Learning Rational Stochastic Tree Languages

Cited in

(7)

• Syntactic stochastic processes: definitions, models, and related inference problems
• Learning Rational Stochastic Tree Languages
• Relevant Representations for the Inference of Rational Stochastic Tree Languages
• Probabilistic grammars and languages
• scientific article; zbMATH DE number 2019601 (Why is no real title available?)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Learning Rational Stochastic Languages

This page was built for publication: Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference

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