The Viterbi algorithm for subsets of stochastic context-free languages

DOI10.1016/J.IPL.2018.03.005MaRDI QIDQ1708272zbMATH OpenOpenAlexWikidataFDO

Authors Peng Zhang

Publication date 5 April 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.03.005

zbMATH Keywords

formal languagesstochastic grammarlinear languagestochastic automatonone-counter language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Stochastic context-free grammars, regular languages, and newton's method
• scientific article; zbMATH DE number 1670709
• scientific article; zbMATH DE number 1303033
• scientific article; zbMATH DE number 1759522
• Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages

Cites work

• scientific article; zbMATH DE number 1408945 (Why is no real title available?)
• Linear Context Free Languages
• On 5′→3′ Sensing Watson-Crick Finite Automata
• One-counter Markov decision processes
• One-counter stochastic games
• Programs with lists are counter automata

Cited in

(5)

• scientific article; zbMATH DE number 1670709 (Why is no real title available?)
• scientific article; zbMATH DE number 1670716 (Why is no real title available?)
• A Constructive Proof of the Existence of Viterbi Processes
• Stochastic context-free grammars, regular languages, and newton's method
• A quasi-polynomial-time algorithm for sampling words from a context-free language

This page was built for publication: The Viterbi algorithm for subsets of stochastic context-free languages

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