Paper Info
Title
Computation of moments for probabilistic finite-state automata.
Abstract
The computation of moments of probabilistic finite-state automata (PFA) is researched in this article. First, the computation of moments of the length of the paths is introduced for general PFA, and then, the computation of moments of the number of times that a symbol appears in the strings generated by the PFA is described. These computations require a matrix inversion. Acyclic PFA, such as word graphs, are quite common in many practical applications. Algorithms for the efficient computation of the moments for acyclic PFA are also presented in this paper.
Year
DOI
Venue
2020
10.1016/j.ins.2019.12.052
Information Sciences
Keywords
Field
DocType
Moments,Probabilistic finite-state automata
Discrete mathematics,Graph,Inversion (meteorology),Matrix (mathematics),Automaton,Algorithm,Probabilistic logic,Probabilistic finite state automata,Mathematics,Computation
Journal
Volume
ISSN
Citations 
516
0020-0255
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Joan-Andreu Sánchez119829.00
Verónica Romero225928.31