Magnus Steinby

37 papers A* 1B 3C 1Journal 24Unranked 5
YearRankTypeTitle / Venue / Authors
2024 J jnl
Volume Edited by Magnus Steinby.
Int. J. Found. Comput. Sci.
Arto Salomaa, Magnus Steinby
2021 J jnl
Directing Words of Fuzzy Finite Automata.
CoRR
Magnus Steinby
2019 J jnl
Fuzzy Deterministic Top-down Tree Automata.
CoRR
Eija Jurvanen, Magnus Steinby
2017 J jnl
Directable Fuzzy and Nondeterministic Automata.
CoRR
Magnus Steinby
2017 J jnl
On DR Tree Automata, Unary Algebras and Syntactic Path Monoids.
Acta Cybern.
Magnus Steinby
2015 J jnl
Rectangular Algebras as Tree Recognizers.
Acta Cybern.
Magnus Steinby
2015 J jnl
Tree Automata.
CoRR
Ferenc Gécseg, Magnus Steinby
2015 J jnl
Varieties of Unranked Tree Languages.
CoRR
Magnus Steinby, Eija Jurvanen, Antonio Cano
2011 J jnl
Rough Approximations in Varieties of Regular Languages.
Fundam. Informaticae
Gabriela Martín, Magnus Steinby
2011 J jnl
Varieties of recognizable tree series over fields.
Theor. Comput. Sci.
Zoltán Fülöp, Magnus Steinby
2009 J jnl
Defining syntax-directed translations by tree bimorphisms.
Theor. Comput. Sci.
Magnus Steinby, Catalin Ionut Tîrnauca
2009 — conf
Formal Series of General Algebras over a Field and Their Syntactic Algebras.
Automata, Formal Languages, and Related Topics
Zoltán Fülöp, Magnus Steinby
2007 C conf
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.
CIAA
Magnus Steinby, Catalin Ionut Tîrnauca
2007 J jnl
Tree algebras and varieties of tree languages.
Theor. Comput. Sci.
Saeed Salehi, Magnus Steinby
2003 — conf
On Commutative Directable Nondeterministic Automata.
Grammars and Automata for String Processing
Balázs Imreh, Masami Ito, Magnus Steinby
2001 — conf
Minimal Recognizers and Syntactic Monoids of DR Tree Languages.
Words, Semigroups, and Transductions
Ferenc Gécseg, Magnus Steinby
2001 J jnl
Piecewise Directable Automata.
J. Autom. Lang. Comb.
Tatjana Petkovic, Magnus Steinby
2000 — conf
Tree Automata in the Theory of Term Rewriting.
Words, Languages & Combinatorics
Magnus Steinby
1999 J jnl
Directable Nondeterministic Automata.
Acta Cybern.
Balázs Imreh, Magnus Steinby
1999 J jnl
On One-Pass Term Rewriting.
Acta Cybern.
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1999 J jnl
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras.
Fundam. Informaticae
Stojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby
1998 J jnl
General Varieties of Tree Languages.
Theor. Comput. Sci.
Magnus Steinby
1998 B conf
On One-Pass Term Rewriting.
MFCS
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1997 — ch.
Tree Languages.
Handbook of Formal Languages (3)
Ferenc Gécseg, Magnus Steinby
1995 J jnl
Some Remarks on Directable Automata.
Acta Cybern.
Balázs Imreh, Magnus Steinby
1994 — conf
Classifying Regular Languages by their Syntactic Algebras.
Results and Trends in Theoretical Computer Science
Magnus Steinby
1994 J jnl
The Inference of Tree Languages from Finite Samples: An Algebraic Approach.
Theor. Comput. Sci.
Timo Knuutila, Magnus Steinby
1993 J jnl
Recognizable and Rational Subsets of Algebras.
Fundam. Informaticae
Magnus Steinby
1992 — ch.
A theory of tree language varieties.
Tree Automata and Languages
Magnus Steinby
1992 J jnl
On generalizations of the Nerode and Myhill theorems.
Bull. EATCS
Magnus Steinby
1990 J jnl
A Formal Theory of Errors in Tree Representations of Patterns.
J. Inf. Process. Cybern.
Magnus Steinby
1989 B conf
Tree Language Problems in Pattern Recognition Theory (Extended Abstract).
FCT
Magnus Steinby
1984 — book
Tree Automata
Ferenc Gécseg, Magnus Steinby
1983 J jnl
Systolic Trees and Systolic Language Recognition by Tree Automata.
Theor. Comput. Sci.
Magnus Steinby
1981 B conf
Some Algebraic Aspects of Recognizability and Rationality.
FCT
Magnus Steinby
1978 J jnl
Minimal ascending tree automata.
Acta Cybern.
Ferenc Gécseg, Magnus Steinby
1977 A* ed.
Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings
ICALP
Arto Salomaa, Magnus Steinby