Fitting probabilistic automata via the em algorithm

DOI10.1080/15326349608807392zbMath0858.60065OpenAlexW1968152823MaRDI QIDQ4895648

William Turin

Publication date: 18 March 1997

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349608807392

zbMATH Keywords

EM algorithmhidden Markov modelsphase type distributionsprobabilistic automatamodel fittingMarkov modulated Poisson processesMarkovian arrivalMarkov modulated Bernoulli processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Measures of information, entropy (94A17) Computer system organization (68M99)

Related Items (2)

Transduction from trees to graphs through folding ⋮ Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique

This page was built for publication: Fitting probabilistic automata via the em algorithm