Fuzzy tree automata

Fuzzy Sets and Systems

Volumn 158, Issue 13, 2007, Pages 1450-1460

  Ésik, Zoltán ^a,b   Liu, Guangwu ^a,c  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b UNIVERSITY OF SZEGED   (Hungary)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Automata; Fuzzy set; Fuzzy system; Fuzzy tree automata

Indexed keywords

ALGEBRA; FUZZY LOGIC; FUZZY SETS; FUZZY SYSTEMS; TREES (MATHEMATICS);

DISTRIBUTIVE LATTICE; FUZZY EQUATIONAL SETS; FUZZY RATIONAL SETS; FUZZY TREE LANGUAGES;

AUTOMATA THEORY;

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

References (31)

1. H. Bekić, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report IBM Vienna, 1967. Also available in: Lecture Notes in Computer Science, Vol. 177, Springer, Berlin, 1994, pp. 30-55.
2. Berstel J., and Reutenauer C. Recognizable formal power series on trees. Theoret. Comput. Sci. 18 (1982) 115-148
3. J. Berstel, C. Reutenauer, Rational Series and their Languages, EATCS Monographs on Theoretical Computer Science, Vol. 12, Springer, Berlin, 1988.
4. Bloom S.L., and Ésik Z. Iteration Theories (1993), Springer, Berlin
5. Bloom S.L., and Ésik Z. An extension theorem with an application to formal tree series. Weighted automata: theory and applications (Dresden, 2002). J. Automat. Lang. Combin. 8 (2003) 145-185
6. Bozapalidis S. Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inform. 28 (1991) 351-363
7. Bozapalidis S. Equational elements in additive algebras. Theory Comput. Systems 32 (1999) 1-33
8. J.R. Büchi, On a decision method of restricted second-order arithmetic, in: Proc. 1960 Internat. Congress for Logic, Stanford University Press, 1962, pp. 1-12.
9. P.M. Cohn, Universal Algebra, second ed., Mathematics and its Applications, Vol. 6, D. Reidel Publishing Co., Dordrecht, Boston, MA, 1981.
10. Davey B.A., and Priestley H.A. Introduction to Lattices and Order. second ed. (2002), Cambridge University Press, New York
11. J.W. De Bakker, D. Scott, A theory of programs, in: IBM Seminar, Vienna, 1969.
12. Denecke K., and Wismarth S.L. Universal Algebra and Applications in Theoretical Computer Science (2002), Chapman & Hall, London
13. S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974.
14. Z. Ésik, W. Kuich, Formal tree series, in: Weighted Automata: Theory and Applications, Dresden, 2002. J. Automat. Lang. Combin. 8 (2003) 219-285.
15. Gécseg F., and Steinby M. Tree Automata (1984), Akadémiai Kiadó, Budapest
16. Grätzer G. Universal Algebra (1979), Springer, Berlin
17. Grätzer G. Identities for globals (complex algebras) of algebras. Colloq. Math. 56 (1988) 19-29
18. Y. Inagaki, T. Fukumura, On the description of fuzzy meaning of context-free language, in: Fuzzy Sets and their Applications to Cognitive and Decision Processes, Proc. U.S.-Japan Seminar, University of California, Berkeley, CA, 1974, Academic Press, New York, 1975, pp. 301-328.
19. S.C. Kleene, Representation of events in nerve nets and finite automata, in: Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 3-42.
20. S. Konstantinidis, N. Santean, S. Yu, Fuzzification of rational and recognizable sets, Technical Report, University of Western Ontario, April 6, 2005.
21. W. Kuich, G. Rahonis, Fuzzy regular languages over finite and infinite words, Fuzzy Sets and Systems 157 (2006) 1532-1549.
22. Mateescu A., Salomaa A., Salomaa K., and Yu S. Lexical analysis with a simple finite fuzzy automata model. J. Universal Comput. 1 5 (1995)
23. Mordeson J., and Malik D. Fuzzy Automata and Languages: Theory and Applications (2002), Chapman & Hall, London
24. Mezei J., and Wright J.B. Algebraic automata and context-free sets. Inform. and Control 11 (1967) 3-29
25. D. Niwinski, Equational μ-calculus, in: Computation Theory (Zaborów, 1984), Lecture Notes in Computer Science, Vol. 208, Springer, Berlin, 1985, pp. 169-176.
26. D. Niwinski, On fixed-point clones (extended abstract), in: Automata, Languages and Programming (Rennes, 1986), Lecture Notes in Computer Science, Vol. 226, Springer, Berlin, pp. 464-473.
27. D. Perrin, J.-E. Pin, Infinite Words, Pure and Applied Mathematics, Vol. 141, Elsevier, Amsterdam, 2004.
28. Rahonis G. Infinite fuzzy computations. Fuzzy Sets and Systems 153 (2005) 275-288
29. Salomaa A. Formal Languages, ACM Monograph Series (1973), Academic Press, New York
30. Schützenberger M.P. On the definition of a family of automata. Inform. and Control 4 (1961) 245-270
31. Zadeh L.A. Fuzzy sets. Inform. and Control 8 (1965) 338-353