Where academic tradition
meets the exciting future

info
AND
AND
AND
AND




Articles in journals (7):

Articles in proceedings (3):

  • Magnus Steinby, Tree Automata in the Theory of Term Rewriting. In: Words, Languages and Combinatorics III, 434-449, World Scientific, 2003.
  • Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi, On one-pass term rewriting. In: Jozef Gruska Lubos Brim, Jirí Zlatuska (Eds.), Mathematical Foundations of Computer Science (Proc. Conf. MFCS'98, Brno, Czech Republic, August 1998), Lecture Notes in Computer Science 1450, 248–256, Springer-Verlag, 1998.
  • Magnus Steinby, Classifying regular languages by their syntactic algebra. In: Results and Trends in Theoretical Computer Science, Lect. Notes Comput. Sci., 396--409, Springer-Verlag, Berlin, 1994.

Chapters in edited books (4):

Technical reports (5):