Magnus Steinby

Affiliations:
  • University of Turku, Finland


According to our database1, Magnus Steinby authored at least 35 papers between 1978 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Volume Edited by Magnus Steinby.
Int. J. Found. Comput. Sci., 2024

2021
Directing Words of Fuzzy Finite Automata.
CoRR, 2021

2019
Fuzzy Deterministic Top-down Tree Automata.
CoRR, 2019

2017
Directable Fuzzy and Nondeterministic Automata.
CoRR, 2017

On DR Tree Automata, Unary Algebras and Syntactic Path Monoids.
Acta Cybern., 2017

2015
Varieties of Unranked Tree Languages.
CoRR, 2015

Tree Automata.
CoRR, 2015

Rectangular Algebras as Tree Recognizers.
Acta Cybern., 2015

2011
Varieties of recognizable tree series over fields.
Theor. Comput. Sci., 2011

Rough Approximations in Varieties of Regular Languages.
Fundam. Informaticae, 2011

2009
Defining syntax-directed translations by tree bimorphisms.
Theor. Comput. Sci., 2009

Formal Series of General Algebras over a Field and Their Syntactic Algebras.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2007
Tree algebras and varieties of tree languages.
Theor. Comput. Sci., 2007

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.
Proceedings of the Implementation and Application of Automata, 2007

2003
On Commutative Directable Nondeterministic Automata.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2001
Piecewise Directable Automata.
J. Autom. Lang. Comb., 2001

Minimal Recognizers and Syntactic Monoids of DR Tree Languages.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Tree Automata in the Theory of Term Rewriting.
Proceedings of the International Colloquium on Words, 2000

1999
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras.
Fundam. Informaticae, 1999

Directable Nondeterministic Automata.
Acta Cybern., 1999

On One-Pass Term Rewriting.
Acta Cybern., 1999

1998
General Varieties of Tree Languages.
Theor. Comput. Sci., 1998

1997
Tree Languages.
Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

1995
Some Remarks on Directable Automata.
Acta Cybern., 1995

1994
The Inference of Tree Languages from Finite Samples: An Algebraic Approach.
Theor. Comput. Sci., 1994

Classifying Regular Languages by their Syntactic Algebras.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Recognizable and Rational Subsets of Algebras.
Fundam. Informaticae, 1993

1992
On generalizations of the Nerode and Myhill theorems.
Bull. EATCS, 1992

A theory of tree language varieties.
Proceedings of the Tree Automata and Languages., 1992

1990
A Formal Theory of Errors in Tree Representations of Patterns.
J. Inf. Process. Cybern., 1990

1989
Tree Language Problems in Pattern Recognition Theory (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989

1984
Tree Automata
Akadéniai Kiadó, Budapest, Hungary, ISBN: 963-05-3170-4, 1984

1983
Systolic Trees and Systolic Language Recognition by Tree Automata.
Theor. Comput. Sci., 1983

1981
Some Algebraic Aspects of Recognizability and Rationality.
Proceedings of the Fundamentals of Computation Theory, 1981

1978
Minimal ascending tree automata.
Acta Cybern., 1978


  Loading...