Cut sets as recognizable tree languages

Fuzzy Sets and Systems

Volumn 157, Issue 11, 2006, Pages 1560-1571

  Borchardt, Björn ^a   Maletti, Andreas ^a   Šešelja, Branimir ^b   Tepavčević, Andreja ^b   Vogler, Heiko ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FORMAL LANGUAGES; FUZZY SETS; NUMERICAL METHODS;

PRIME FILTERS; RECOGNIZABLE TREE SERIES; SUFFICIENT CONDITIONS; TREE LANGUAGE;

TREES (MATHEMATICS);

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

References (29)

1. Asveld P. Algebraic aspects of families of fuzzy languages. Theoret. Comput. Sci. 293 (2003) 417-445
2. Bělohlávek R. Determinism and fuzzy automata. Inform. Sci. 143 (2002) 205-209
3. Berstel J., and Reutenauer C. Recognizable formal power series on trees. Theoret. Comput. Sci. 18 2 (1982) 115-148
4. B. Borchardt, The theory of recognizable tree series, Ph.D. Thesis, Dresden University of Technology, 2004.
5. Borchardt B., and Vogler H. Determinization of finite state weighted tree automata. J. Automata, Languages Combin. 8 3 (2003) 417-463
6. Bozapalidis S. Positive tree representations and applications to tree automata. Inform. and Control 139 2 (1997) 130-153
7. Bozapalidis S., and Alexandrakis A. Representation matricielles de series d'arbre reconnaissables. Theoret. Informatics Appl. 23 4 (1989) 449-459
8. Cohn P. Universal Algebra. second ed. (1981), D. Reidel Publishing Company
9. Davey B.A., and Priestley H.A. Introduction to Lattices and Order. second ed. (2002), Cambridge University, Cambridge
10. Droste M., Pech C., and Vogler H. A Kleene theorem for weighted tree automata. Theory Comput. Systems 38 (2005) 1-38
11. Ésik Z., and Kuich W. Formal tree series. J. Automata, Languages, Combin. 8 2 (2003) 219-285
12. Gécseg F., and Steinby M. Tree Automata (1984), Akadémiai Kiadó, Budapest
13. F. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer, Berlin, 1997, pp. 1-68 (Chapter 1).
14. Goguen J. L-fuzzy sets. J. Math. Anal. Appl. 18 (1967) 145-174
15. Golan J.S. Semirings and their Applications (1999), Kluwer Academic Publishers, Dordrecht
16. Grätzer G. General Lattice Theory. second ed. (1979), Birkhäuser, Basel
17. Hebisch U., and Weinert H. Semirings-Algebraic Theory and Applications in Computer Science (1998), World Scientific, Singapore
18. Kozen D. On the Myhill-Nerode theorem for trees. EATCS Bull. 47 (1992) 170-173
19. Kuich W. Formal power series over trees. In: Bozapalidis S. (Ed). 3rd Internat. Conf. Developments in Language Theory, DLT 1997, Thessaloniki, Greece, Proceedings, Aristotle University of Thessaloniki (1998) 61-101
20. J. Myhill, Finite automata and the representation of events, Technical Report, Wright Patterson Air Force Base, Dayton, 1957.
21. Nerode A. Linear automata transactions. Proc. Amer. Math. Soc. 9 (1958) 541-544
22. C. Pech, Kleene-type results for weighted tree automata, Ph.D. Thesis, Dresden University of Technology, 2003.
23. Santos E. Maximin automata. Inform. and Control 13 (1968) 363-377
24. Seidl H. Finite tree automata with cost functions. Theoret. Comput. Sci. 126 1 (1994) 113-142
25. Šešelja B., and Tepavčević A. On a generalization of fuzzy algebras and congruences. Fuzzy Sets and Systems 65 (1994) 85-94
26. Šešelja B., and Tepavčević A. Representing ordered structures by fuzzy sets. Fuzzy Sets and Systems 136 1 (2003) 21-39
27. Šešelja B., and Tepavčević A. Completion of ordered structures by cuts of fuzzy sets, an overview. Fuzzy Sets and Systems 136 1 (2003) 1-19
28. M. Thomason, P. Marinos, Deterministic acceptors of regular fuzzy languages, IEEE Trans. Systems, Man, Cybernetics (3) (1974) 228-230.
29. Wechler W. The Concept of Fuzziness in Automata and Language Theory, fifth ed., Studien zur Algebra und ihre Anwendungen (1978), Akademie-Verlag, Berlin