Varieties of tree languages definable by syntactic monoids

Acta Cybernetica

Volumn 17, Issue 1, 2005, Pages 21-41

  Salehi, Saeed ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23744475272     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Almeida J., On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis 27 (1990) 333-350.
2. Birkhoff G., On the structure of abstract algebras, Proc. Cambridge Phil. Soc. 31 (1935) 433-454.
3. Eilenberg S., Automata, Languages, and Machines, Vol. B. Pure and Applied Mathematics, Vol. 59, Academic Press, New York - London (1976).
4. Ésik Z., A variety theorem for trees and theories, Automata and formal languages VIII (Salgótarján, 1996), Publ. Math. Debrecen 54 (1999), suppl., 711-762.
5. Ésik Z. & Weil P., On Logically Defined Recognizable Tree Languages, Proceedings of FSTTCS'03, Lect. Notes in Comp. Sci. 2914, Springer-Verlag (2003), 195-207.
6. Nivat M. & Podelski A., Tree monoids and recognizability of sets of finite trees, Resolution of Equations in Algebraic Structures, Vol. 1, Academic Press, Boston MA (1989) 351-367.
7. Nivat M. & Podelski A., Definite tree languages (cont'd), Bull. EATCS 38 (1989) 186-190.
8. Petković T., Ćirić M. & Bogdanović S., Unary algebras, semigroups and congruences on free semigroups, Theoret. Comput. Sci. 324 (2004) 87-105.
9. Petković T., Ćirić M. & Bogdanović S., Eilenberg type theorems for automata, submitted.
10. Pin J.E., Varieties of formal languages, Foundations of Computer Science, Plenum Publishing Corp., New York (1986).
11. Pin J.E., A variety theorem without complementation, Izvestiya VUZ Matematika 39 (1995) 80-90.
12. Piirainen V., Monotone algebras, R-trivial monoids and a variety of tree languages, Bull. EATCS 84 (2004) 189-194.
13. Podelski A., A monoid approach to tree languages, in: Nivat M. & Podelski A. (ed.) Tree Automata and Languages, Elsevier-Amsterdam (1992) 41-56.
14. Salomaa K., Syntactic monoids of regular forests (Finnish), M.Sc. Thesis, Deptartment of Mathematics, Turku University (1983).
15. Schützenberger M. P., On finite monoids having only trivial subgroups, Information and Control 8 (1965) 190-194.
16. Steinby M., Syntactic algebras and varieties of recognizbale sets, in: Proc. CAAP'79 (University of Lille 1979) 226-240.
17. Steinby M., A theory of tree language varieties, in: Nivat M. & Podelski A. (ed.) Tree Automata and Languages, Elsevier-Amsterdam (1992) 57-81.
18. Steinby M., General varieties of tree languages, Theoret. Comput. Sci. 205 (1998) 1-43. (Pubitemid 128449916)
19. Thérien D., Recognizable languages and congruences, Semigroup Forum 23 (1981) 371-373.
20. Thomas W., Logical aspects in the study of tree languages, Ninth Colloquium on Trees in Algebra and in Programming (Proc. CAAP'84), Cambridge University Press (1984) 31-51.
21. Wilke T., An algebraic characterization of frontier testable tree languages, Theoret. Comput. Sci. 154 (1996) 85-106.