Pumping lemma in automata theory based on complete residuated lattice-valued logic: A note

Fuzzy Sets and Systems

Volumn 157, Issue 15, 2006, Pages 2128-2138

  Qiu, Daowen ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Fuzzy finite automata; Non classical logic; Pumping lemma

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LOGIC; FUZZY SETS; LATTICE CONSTANTS;

FUZZY FINITE AUTOMATA; NON-CLASSICAL LOGIC; PUMPING LEMMA;

AUTOMATA THEORY;

EID: 33744917237     PISSN: 01650114     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.fss.2006.03.014     Document Type: Article

References (26)

1. Alon N., Dewdney A., and Ott T. Efficient simulation of finite automata by neural nets. J. Assoc. Comput. Mach. 38 2 (1991) 498-514
2. Booch G., Rumbaugh J., and Jacobson I. The Unified Modeling Language User Guide (1999), Addison-Wesley, Reading MA
3. Dilworth R.P. Abstract residuation over lattices. Bull. Amer. Math. Soc. 44 (1938) 262-268
4. Dubois D., and Prade H. Fuzzy Sets and Systems: Theory and Applications (1980), Academic, New York
5. Girard J.-Y. Linear logic. Theoret. Comput. Sci. 50 (1987) 1-102
6. Gupta M.M., Saridis G.N., and Gaines B.R. Fuzzy Automata and Decision Processes (1997), North-Holland, New York
7. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley, Reading MA
8. Kandel A., and Lee S.C. Fuzzy Switching and Automata: Theory and Applications (1997), Crane Russak, New York
9. Malik D.S., and Mordeson J.N. Fuzzy Discrete Structures (2000), Physica-Verlag, New York
10. Mordeson J.N., and Malik D.S. Fuzzy Automata and Languages: Theory and Applications (2002), Chapman & Hall/CRC, Boca Raton, London
11. Omlin C.W., Thornber K.K., and Giles C.L. Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks. IEEE Trans. Fuzzy Systems 6 (1998) 76-89
12. Pavelka J. On fuzzy logic I: many-valued rules of inferences. Z. Math. Logik Grundlagen Math. 25 (1979) 45-52
13. Pavelka J. On fuzzy logic II: enriched residuated lattices and semantics of propositional calculi. Z. Math. Logik Grundlagen Math. 25 (1979) 119-134
14. Pavelka J. On fuzzy logic III: semantical completeness of some many-valued propositional calculi. Z. Math. Logik Grundlagen Math. 25 (1979) 447-464
15. Qiu D.W. Automata theory based on completed residuated lattice-valued logic (I). Sci. China (F) 44 6 (2001) 419-429
16. Qiu D.W. Automata theory based on completed residuated lattice-valued logic (II). Sci. China (F) 45 6 (2002) 442-452
17. D. Raymond, D. Wood, S. Yu, Automata Implemention, First Internat. Workshop on Implementing Automata, Lecture Notes in Computer Science, Vol. 1260, Springer, Berlin, 1996.
18. Rescher N. Many-Valued Logic (1969), McGraw-Hill, New York
19. Rosser J.B., and Turquette A.R. Many-Valued Logics (1952), North-Holland, Amsterdam
20. Salomaa A. Theory of Automata (1969), Pergamon Press, Oxford
21. Santos E.S. Maximin automata. Inform. and Control. 13 (1968) 363-377
22. Thomason M.G., and Marinos P.N. Deterministic acceptors of regular fuzzy languages. IEEE Trans. Systems, Man, Cybernetics 4 (1974) 228-230
23. W.G. Wee, On generalizations of adaptive algorithm and application of the fuzzy sets concept to pattern classification, Ph.D. Thesis, Purdue University, West lafayett, IN, June 1967.
24. Yu S. Regular languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages (1997), Springer, Berlin 41-110
25. Ying M.S. Fuzzifying topology based on complete residuated lattice-valued logic (I). Fuzzy Sets and Systems 56 (1993) 337-373
26. Zadeh L.A. Fuzzy sets and systems. Proc. Symp. System Theory (1965), Polytechnic Institute of Brooklyn, New York 29-37