Magnus Steinby - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2024

Volume Edited by Magnus SteinbyArto Salomaa, Magnus Steinby. ijfcs, 35(1&2):7-10, January & February 2024. [doi]

2017

On DR Tree Automata, Unary Algebras and Syntactic Path MonoidsMagnus Steinby. actaC, 23(1):159-174, 2017. [doi]

2015

Rectangular Algebras as Tree RecognizersMagnus Steinby. actaC, 22(2):499-515, 2015. [doi]

2011

Varieties of recognizable tree series over fieldsZoltán Fülöp, Magnus Steinby. TCS, 412(8-10):736-752, 2011. [doi]

Rough Approximations in Varieties of Regular LanguagesGabriela Martín, Magnus Steinby. FUIN, 112(4):281-303, 2011. [doi]

2009

Formal Series of General Algebras over a Field and Their Syntactic AlgebrasZoltán Fülöp, Magnus Steinby. birthday 2009: 55-78

Defining syntax-directed translations by tree bimorphismsMagnus Steinby, Catalin Ionut TÃ®rnauca. TCS, 410(37):3495-3503, 2009. [doi]

2007

Tree algebras and varieties of tree languagesSaeed Salehi, Magnus Steinby. TCS, 377(1-3):1-24, 2007. [doi]

Syntax-Directed Translations and Quasi-alphabetic Tree BimorphismsMagnus Steinby, Catalin Ionut Tîrnauca. wia 2007: 265-276 [doi]

2003

On Commutative Directable Nondeterministic AutomataBalázs Imreh, Masami Ito, Magnus Steinby. BIRTHDAY 2003: 141-150

2001

Minimal Recognizers and Syntactic Monoids of DR Tree LanguagesFerenc Gécseg, Magnus Steinby. BIRTHDAY 2001: 155-167

Piecewise Directable AutomataTatjana Petkovic, Magnus Steinby. jalc, 6(2):205-220, 2001.

2000

Tree Automata in the Theory of Term RewritingMagnus Steinby. dlt 2003: 434-449

1999

Traps, Cores, Extensions and Subdirect Decompositions of Unary AlgebrasStojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby. FUIN, 38(1-2):51-60, 1999.

On One-Pass Term RewritingZoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi. actaC, 14(1):83-98, 1999. [doi]

Directable Nondeterministic AutomataBalázs Imreh, Magnus Steinby. actaC, 14(1):105-116, 1999. [doi]

1998

On One-Pass Term RewritingZoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi. mfcs 1998: 248-256 [doi]

General Varieties of Tree LanguagesMagnus Steinby. TCS, 205(1-2):1-43, 1998. [doi]

1995

Some Remarks on Directable AutomataBalázs Imreh, Magnus Steinby. actaC, 12(1):23-36, 1995. [doi]

1994

The Inference of Tree Languages from Finite Samples: An Algebraic ApproachTimo Knuutila, Magnus Steinby. TCS, 129(2):337-367, 1994.

Classifying Regular Languages by their Syntactic AlgebrasMagnus Steinby. BIRTHDAY 1994: 396-409

1993

Recognizable and Rational Subsets of AlgebrasMagnus Steinby. FUIN, 18:249-266, 1993.

1992

A theory of tree language varietiesMagnus Steinby. In Tree Automata and Languages. pages 57-82, 1992.

On generalizations of the Nerode and Myhill theoremsMagnus Steinby. eatcs, 48:191-196, 1992.

1990

A Formal Theory of Errors in Tree Representations of PatternsMagnus Steinby. eik, 26(1/2):19-32, 1990.

1989

Tree Language Problems in Pattern Recognition Theory (Extended Abstract)Magnus Steinby. fct 1989: 444-450

1984

Tree AutomataFerenc Gécseg, Magnus Steinby. Akadéniai Kiadó, Budapest, Hungary, 1984.

1983

Systolic Trees and Systolic Language Recognition by Tree AutomataMagnus Steinby. TCS, 22:219-232, 1983.

1981

Some Algebraic Aspects of Recognizability and RationalityMagnus Steinby. fct 1981: 360-372

1980

Minimal ascending tree automataFerenc Gécseg, Magnus Steinby. actaC, 4:37-44, 1980.

Sign in or sign up to see more results.

runs on WebDSL