Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-08-26
Computer Science
Formal Languages and Automata Theory
41 pages, 9 figures
Scientific paper
We investigate the continuity of the \omega-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous \omega-function definable by some WFA can be defined by an average preserving WFA and then characterize minimal average preserving WFA whose \omega-function or \omega-function and real function are continuous. We obtain several algorithmic reductions for WFA-related decision problems. In particular, we show that deciding whether the \omega-function and real function of an average preserving WFA are both continuous is computationally equivalent to deciding stability of a set of matrices. We also present a method for constructing WFA that compute continuous real functions.
Kari Jarkko
Kazda Alexandr
Steinby Paula
No associations
LandOfFree
On Continuous Weighted Finite Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Continuous Weighted Finite Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Continuous Weighted Finite Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-624177