I have a question regarding fuzzy finite-state automata:
Typically, the membership function of a particular derivation
of some string is defined as the minimum over all transition
`uncertainties' of that derivation and the membership function
of the string is then defined as the maximum over all derivations
of that string.
The above definition seems to preclude computing the string
membership function in real time, i.e. the entire string
has to be known a priori in order to compute its membership.
I was wondering whether there is a way to compute the string
membership on the fly or whether there are definitions of
fuzzy string membership functions which are commonly used and
which allow string membership to be computed on the fly.
Any ideas or references would be much appreciated. Please
send replies to omlinc@cs.rpi.edu.
Thanks.
Christian
computing the string membership if only one symbol is read