On Minimizing Weighted Finite Automata

碩士 === 國立臺灣大學 === 電機工程學研究所 === 96 === Weighted Finite Automata represent a very general model which has many different names such as probabilistic finite automata (PFA), hidden Markov models (HMM), stochastic regular grammars, Markov chains and n-grams. These models play central roles in many domain...

Full description

Bibliographic Details
Main Authors: Ting-Yuan Huang, 黃亭遠
Other Authors: Hsu-Chun Yen
Format: Others
Language:en_US
Published: 2008
Online Access:http://ndltd.ncl.edu.tw/handle/64923272723918819375