| 2007 |
|---|
| 22 | EE | Magnus Steinby,
Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.
CIAA 2007: 265-276 |
| 21 | EE | Saeed Salehi,
Magnus Steinby:
Tree algebras and varieties of tree languages.
Theor. Comput. Sci. 377(1-3): 1-24 (2007) |
| 2003 |
|---|
| 20 | | Balázs Imreh,
Masami Ito,
Magnus Steinby:
On Commutative Directable Nondeterministic Automata.
Grammars and Automata for String Processing 2003: 141-150 |
| 2001 |
|---|
| 19 | | Ferenc Gécseg,
Magnus Steinby:
Minimal Recognizers and Syntactic Monoids of DR Tree Languages.
Words, Semigroups, and Transductions 2001: 155-167 |
| 18 | | Tatjana Petkovic,
Magnus Steinby:
Piecewise Directable Automata.
Journal of Automata, Languages and Combinatorics 6(2): 205-220 (2001) |
| 1999 |
|---|
| 17 | EE | Balázs Imreh,
Magnus Steinby:
Directable Nondeterministic Automata.
Acta Cybern. 14(1): 105-116 (1999) |
| 16 | EE | Zoltán Fülöp,
Eija Jurvanen,
Magnus Steinby,
Sándor Vágvölgyi:
On One-Pass Term Rewriting.
Acta Cybern. 14(1): 83-98 (1999) |
| 15 | | Stojan Bogdanovic,
Miroslav Ciric,
Tatjana Petkovic,
Balázs Imreh,
Magnus Steinby:
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras.
Fundam. Inform. 38(1-2): 51-60 (1999) |
| 1998 |
|---|
| 14 | EE | Zoltán Fülöp,
Eija Jurvanen,
Magnus Steinby,
Sándor Vágvölgyi:
On One-Pass Term Rewriting.
MFCS 1998: 248-256 |
| 13 | EE | Magnus Steinby:
General Varieties of Tree Languages.
Theor. Comput. Sci. 205(1-2): 1-43 (1998) |
| 1995 |
|---|
| 12 | EE | Balázs Imreh,
Magnus Steinby:
Some Remarks on Directable Automata.
Acta Cybern. 12(1): 23-36 (1995) |
| 1994 |
|---|
| 11 | | Magnus Steinby:
Classifying Regular Languages by their Syntactic Algebras.
Results and Trends in Theoretical Computer Science 1994: 396-409 |
| 10 | | Timo Knuutila,
Magnus Steinby:
The Inference of Tree Languages from Finite Samples: An Algebraic Approach.
Theor. Comput. Sci. 129(2): 337-367 (1994) |
| 1993 |
|---|
| 9 | | Magnus Steinby:
Recognizable and Rational Subsets of Algebras.
Fundam. Inform. 18: 249-266 (1993) |
| 1992 |
|---|
| 8 | | Magnus Steinby:
A theory of tree language varieties.
Tree Automata and Languages 1992: 57-82 |
| 7 | | Magnus Steinby:
On generalizations of the Nerode and Myhill theorems.
Bulletin of the EATCS 48: 191-196 (1992) |
| 1990 |
|---|
| 6 | | Magnus Steinby:
A Formal Theory of Errors in Tree Representations of Patterns.
Elektronische Informationsverarbeitung und Kybernetik 26(1/2): 19-32 (1990) |
| 1989 |
|---|
| 5 | | Magnus Steinby:
Tree Language Problems in Pattern Recognition Theory (Extended Abstract).
FCT 1989: 444-450 |
| 1983 |
|---|
| 4 | | Magnus Steinby:
Systolic Trees and Systolic Language Recognition by Tree Automata.
Theor. Comput. Sci. 22: 219-232 (1983) |
| 1981 |
|---|
| 3 | | Magnus Steinby:
Some Algebraic Aspects of Recognizability and Rationality.
FCT 1981: 360-372 |
| 1980 |
|---|
| 2 | | Ferenc Gécseg,
Magnus Steinby:
Minimal ascending tree automata.
Acta Cybern. 4: 37-44 (1980) |
| 1977 |
|---|
| 1 | | Arto Salomaa,
Magnus Steinby:
Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings
Springer 1977 |
