Search the dblp DataBase

Publications of Author

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