A fuzzy finite-state automaton definition that unifies a number of other popular computational paradigms

Intelligent Engineering Systems Through Artificial Neural Networks

Volumn 13, Issue , 2003, Pages 441-446

  Doostfatemeh, Mansoor ^a   Kremer, Stefan C ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; FUZZY SETS; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; RECURRENT NEURAL NETWORKS;

ACTIVE STATES; FUNCTION MAPPING; FUZZY STATE-SETS; SOURCE-STATE MEMBERSHIP;

FINITE AUTOMATA;

EID: 2442513926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Giles, C., Sun, G., Chen, H., Lee, Y., and Chen, D. (1990). Higher order recurrent networks & grammatical inference. In Touretzky, D. S., editor, Advances in Neural Information Processing Systems 2, pages 380-387, San Mateo, CA. Morgan Kaufmann Publishers.
2. Hopcrotf, J. E. and Ullman, J. D. (1979). Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA.
3. Klir, G. J. and Yuan, B. (1995). Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice Hall, Upper Saddle River, NJ.
4. Mealy, G. (1955). A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5): 1045-1079.
5. Moore, E. (1956). Gedanken experiments on sequential machines. In Automata Studies, pages 129-153. Princeton University Press, Princeton NJ.
6. Mordeson, J. N. and Malik, D. S. (2002). Fuzzy Automata and Languages. Chapman & Hall/CRC, New York, NY.
7. Omlin, C. W., Giles, C. L., and Thornber, K. K. (1999). Equivalence in knowledge representation: automata, recurrent neural networks, and dynamical fuzzy systems. Proc. of IEEE, 87(9): 1623-1640.
8. Omlin, C. W., Thornber, K. K., and Giles, C. L. (1998). Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks. IEEE Trans. on Fuzzy Systems, 5(1):76-89.