default search action
Magnus Steinby
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Arto Salomaa, Magnus Steinby:
Volume Edited by Magnus Steinby. Int. J. Found. Comput. Sci. 35(1&2): 7-10 (2024) - 2021
- [i5]Magnus Steinby:
Directing Words of Fuzzy Finite Automata. CoRR abs/2103.00942 (2021)
2010 – 2019
- 2019
- [i4]Eija Jurvanen, Magnus Steinby:
Fuzzy Deterministic Top-down Tree Automata. CoRR abs/1911.11529 (2019) - 2017
- [j18]Magnus Steinby:
On DR Tree Automata, Unary Algebras and Syntactic Path Monoids. Acta Cybern. 23(1): 159-174 (2017) - [i3]Magnus Steinby:
Directable Fuzzy and Nondeterministic Automata. CoRR abs/1709.07719 (2017) - 2015
- [j17]Magnus Steinby:
Rectangular Algebras as Tree Recognizers. Acta Cybern. 22(2): 499-515 (2015) - [i2]Ferenc Gécseg, Magnus Steinby:
Tree Automata. CoRR abs/1509.06233 (2015) - [i1]Magnus Steinby, Eija Jurvanen, Antonio Cano:
Varieties of Unranked Tree Languages. CoRR abs/1510.07402 (2015) - 2011
- [j16]Gabriela Martín, Magnus Steinby:
Rough Approximations in Varieties of Regular Languages. Fundam. Informaticae 112(4): 281-303 (2011) - [j15]Zoltán Fülöp, Magnus Steinby:
Varieties of recognizable tree series over fields. Theor. Comput. Sci. 412(8-10): 736-752 (2011)
2000 – 2009
- 2009
- [j14]Magnus Steinby, Catalin Ionut Tîrnauca
:
Defining syntax-directed translations by tree bimorphisms. Theor. Comput. Sci. 410(37): 3495-3503 (2009) - [c9]Zoltán Fülöp, Magnus Steinby:
Formal Series of General Algebras over a Field and Their Syntactic Algebras. Automata, Formal Languages, and Related Topics 2009: 55-78 - 2007
- [j13]Saeed Salehi
Tree algebras and varieties of tree languages. Theor. Comput. Sci. 377(1-3): 1-24 (2007) - [c8]Magnus Steinby, Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms. CIAA 2007: 265-276 - 2003
- [c7]Balázs Imreh, Masami Ito, Magnus Steinby:
On Commutative Directable Nondeterministic Automata. Grammars and Automata for String Processing 2003: 141-150 - 2001
- [j12]Tatjana Petkovic, Magnus Steinby:
Piecewise Directable Automata. J. Autom. Lang. Comb. 6(2): 205-220 (2001) - [c6]Ferenc Gécseg, Magnus Steinby:
Minimal Recognizers and Syntactic Monoids of DR Tree Languages. Words, Semigroups, and Transductions 2001: 155-167 - 2000
- [c5]Magnus Steinby:
Tree Automata in the Theory of Term Rewriting. Words, Languages & Combinatorics 2000: 434-449
1990 – 1999
- 1999
- [j11]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) - [j10]Balázs Imreh, Magnus Steinby:
Directable Nondeterministic Automata. Acta Cybern. 14(1): 105-115 (1999) - [j9]Stojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby:
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras. Fundam. Informaticae 38(1-2): 51-60 (1999) - 1998
- [j8]Magnus Steinby:
General Varieties of Tree Languages. Theor. Comput. Sci. 205(1-2): 1-43 (1998) - [c4]Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi:
On One-Pass Term Rewriting. MFCS 1998: 248-256 - 1997
- [p2]Ferenc Gécseg, Magnus Steinby:
Tree Languages. Handbook of Formal Languages (3) 1997: 1-68 - 1995
- [j7]Balázs Imreh, Magnus Steinby:
Some Remarks on Directable Automata. Acta Cybern. 12(1): 23-35 (1995) - 1994
- [j6]Timo Knuutila, Magnus Steinby:
The Inference of Tree Languages from Finite Samples: An Algebraic Approach. Theor. Comput. Sci. 129(2): 337-367 (1994) - [c3]Magnus Steinby:
Classifying Regular Languages by their Syntactic Algebras. Results and Trends in Theoretical Computer Science 1994: 396-409 - 1993
- [j5]Magnus Steinby:
Recognizable and Rational Subsets of Algebras. Fundam. Informaticae 18: 249-266 (1993) - 1992
- [j4]Magnus Steinby:
On generalizations of the Nerode and Myhill theorems. Bull. EATCS 48: 191-196 (1992) - [p1]Magnus Steinby:
A theory of tree language varieties. Tree Automata and Languages 1992: 57-82 - 1990
- [j3]Magnus Steinby:
A Formal Theory of Errors in Tree Representations of Patterns. J. Inf. Process. Cybern. 26(1/2): 19-32 (1990)
1980 – 1989
- 1989
- [c2]Magnus Steinby:
Tree Language Problems in Pattern Recognition Theory (Extended Abstract). FCT 1989: 444-450 - 1984
- [b1]Ferenc Gécseg, Magnus Steinby:
Tree Automata. Akadéniai Kiadó, Budapest, Hungary 1984, ISBN 963-05-3170-4 - 1983
- [j2]Magnus Steinby:
Systolic Trees and Systolic Language Recognition by Tree Automata. Theor. Comput. Sci. 22: 219-232 (1983) - 1981
- [c1]Magnus Steinby:
Some Algebraic Aspects of Recognizability and Rationality. FCT 1981: 360-372
1970 – 1979
- 1978
- [j1]Ferenc Gécseg, Magnus Steinby:
Minimal ascending tree automata. Acta Cybern. 4(1): 37-44 (1978) - 1977
- [e1]Arto Salomaa, Magnus Steinby:
Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings. Lecture Notes in Computer Science 52, Springer 1977, ISBN 3-540-08342-1 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: