Some recent publications

• M. Steinby: Finite tree automata and regular tree languages. An introduction. Formal Languages and Applications.<\I> Fuzzines and Soft Computing, vol. 148 (Eds.C. Martin-Vide, V. Mitrana and G. Paun), Springer, pages 411-427. <\LI>
• S. Bogdanovic´, M. C´iric´, B. Imreh, T. Petkovic´ and M. Steinby: On local properties of unary algebras. Algebra Colloquium 10:4, pages 461-478, 2003.
• M. Steinby: Tree automata in the theory of term rewriting. Words, Languages and Combinatorics III<\I> (Proc. Third Intern. Cool., Kyoto, March 2000, eds. M. Ito and T. Imaoka), World Scientific, New Jersey, pages 434-449, 2001.
• B. Imreh, M. Ito and M. Steinby: On commutative nondeterministic directable automata. Grammars and Automata for String Processing. From Mathematics and Computer Science to Biology and Back.<\I> (Eds. C. Martin-Vide and V. Mitrana), Taylor & Francis, London, pages 205-220, 2003.
• F. Gécseg and M. Steinby: Minimal recognizers and syntactic monoids of DR tree languages. Words, Semigroups and Transductions. (Eds. M. Ito, G. Paun and S. Yu), World Scientific, Singapore, pages 155-167, 2001
• T. Petkovic´ and M. Steinby: Piecewise directable automata. J. Automata, Languages and Combinatorics 6, pages 205-220, 2001.
• M. Steinby and W. Thomas: Trees and term rewriting in 1910: On a paper by Axel Thue. EATCS Bull. 72, pages 256-269, 2000.
• M. C´iric´, B. Imreh and M. Steinby: Subdirectly irreducible definite, reverse definite and generalized definite automata. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 10, pages 69-79, 1999.
• S. Bogdanovic´, M. C´iric´, T. Petkovic´, B. Imreh and M. Steinby: Traps, cores, extensions and subdirect decompositions of unary algebras. Fundamenta Informaticae 38, pages 51-60, 1999
• B. Imreh and M. Steinby: Directable nondeterministic automata. Acta Cybernetica 14, pages 105-115, 1999.
• Z. Fülöp, E. Jurvanen, M. Steinby and S. Vágvölgyi: On one-pass term rewriting. Acta Cybernetica 14, pages 83-98, 1999.
• M. Steinby: General varieties of tree languages, Theoretical Computer Science 205, pages 1-43, 1998.
• Z. Fülöp, E. Jurvanen, M. Steinby and S. Vágvölgyi: On one-pass term rewriting. Mathematical Foundations of Computer Science. (Proc. Conf. MFCS98, Brno, Czech Republic, August 1998), Lecture Notes in Computer Science 1450, Springer-Verlag, Berlin, pages 248-256.
• F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Beyond Words, volume 3 of Handbook of Formal Languages, chapter 1, pages 1-68. Springer-Verlag, Berlin, 1997.
• M. Steinby. Karkeat joukot ja epätäydellinen tieto (Rough sets and incomplete knowledge. In Finnish). In J. Palomäki and I. Koskinen, editors, Tiedon loogisesta esittämisestä, volume 62 of Filosofisia tutkimuksia Tampereen yliopistosta, pages 1-21. Tampereen yliopisto, Tampere, 1997.
• B. Imreh and M. Steinby. Some remarks on directable automata. Acta Cybern. 12, No. 1, pages 23-35, 1995.
• T. Knuutila and M. Steinby. The inference of tree languages from finite samples: an algebraic approach. Theor. Comput. Sci. 129, No. 2, pages 337-367, 1994.
• M. Steinby. Classifying regular languages by their syntactic algebras. In J. Karhumäki, H. Maurer, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, number 812 in Lect. Notes Comput. Sci., pages 396-409. Springer-Verlag, Berlin, 1994.
• M. Steinby. Recognizable and rational subsets of algebras. Fundamenta Informaticae 18, No.2-4, pages 249-266, 1993.
• M. Steinby. A theory of tree language varieties. In M. Nivat and A. Podelski (eds.) Tree Automata and Languages, pages 57-81. Elsevier Science Publishers B.V., Amsterdam 1992.
• M. Steinby. A formal theory of errors in tree representations of patterns. J. Inf. Process. EIK 26, No. 1/2, pages 19-32, 1990.