New directions in fuzzy automata

@article{Kremer05, abstract = {Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, the increasing interest in using fuzzy logic for many new areas necessitates that the formalism of fuzzy automata be more developed and better established to fulfill implementational requirements in a well-defined manner. This need is due to the fact that despite the long history of fuzzy automata and lots of research being done on that, there are still some issues which have not been well-established and issues which need some kind of revision. In particular, we focus on membership assignment, output mapping, multi-membership resolution, and the concept of acceptance for fuzzy automata. We develop a new general definition for fuzzy automata, and based on that, develop well-defined and application-driven methodologies to establish a better ground for fuzzy automata and pave the way for forthcoming applications.}, author = {Doostfatemeh, Mansoor and Kremer, Stefan C. }, citeulike-article-id = {2618749}, doi = {http://dx.doi.org/10.1016/j.ijar.2004.08.001}, journal = {International Journal of Approximate Reasoning}, keywords = {automata, fuzzy}, month = {February}, number = {2}, pages = {175--214}, posted-at = {2008-05-26 09:04:44}, priority = {2}, title = {New directions in fuzzy automata}, url = {http://dx.doi.org/10.1016/j.ijar.2004.08.001}, volume = {38}, year = {2005} }

TY - JOUR ID - Kremer05 L3 - citeulike-article-id:2618749 TI - New directions in fuzzy automata JF - International Journal of Approximate Reasoning VL - 38 IS - 2 SP - 175 EP - 214 N2 - Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, the increasing interest in using fuzzy logic for many new areas necessitates that the formalism of fuzzy automata be more developed and better established to fulfill implementational requirements in a well-defined manner. This need is due to the fact that despite the long history of fuzzy automata and lots of research being done on that, there are still some issues which have not been well-established and issues which need some kind of revision. In particular, we focus on membership assignment, output mapping, multi-membership resolution, and the concept of acceptance for fuzzy automata. We develop a new general definition for fuzzy automata, and based on that, develop well-defined and application-driven methodologies to establish a better ground for fuzzy automata and pave the way for forthcoming applications. KW - automata KW - fuzzy AU - Doostfatemeh, Mansoor AU - Kremer, Stefan PY - 2005/02// UR - http://dx.doi.org/10.1016/j.ijar.2004.08.001 ER -