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...
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 |
Similar Items
-
Minimization of symmetric difference finite automata
by: Muller, Graham
Published: (2006) -
Constructing minimal acyclic deterministic finite automata
by: Watson, Bruce William
Published: (2013) -
Computing the weight of subtasks in state minimization of nondeterministic finite automata by the branch and bound method
by: M.E. Abramyan
Published: (2021-09-01) -
Hyper-Minimization for Deterministic Weighted Tree Automata
by: Andreas Maletti, et al.
Published: (2014-05-01) -
Efficient Implementation for Deterministic Finite Tree Automata Minimization
by: Younes Guellouma, et al.
Published: (2016-12-01)