Magnus Steinby
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Molecular Biology
- Computer Networks and Communications
- Information Systems
- Co-authors
- Ferenc GécsegTimo KnuutilaArto SalomaaZoltán FülöpTatjana PetkovićMiroslav ĆirićStojan Bogdanović
- Topics
- semigroups and automata theory (17 papers)Advanced Algebra and Logic (11 papers)Logic, programming, and type systems (5 papers)
In The Last Decade
Magnus Steinby
17 papers receiving 97 citations
Peers
Comparison fields: 5 of 15
- Computational Theory and Mathematics 99
- Artificial Intelligence 86
- Molecular Biology 18
- Computer Networks and Communications 3
- Information Systems 2
Countries citing papers authored by Magnus Steinby
This map shows the geographic impact of Magnus Steinby's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Magnus Steinby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Magnus Steinby more than expected).
Fields of papers citing papers by Magnus Steinby
This network shows the impact of papers produced by Magnus Steinby. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Magnus Steinby. The network helps show where Magnus Steinby may publish in the future.
Co-authorship network of co-authors of Magnus Steinby
This figure shows the co-authorship network connecting the top 25 collaborators of Magnus Steinby. A scholar is included among the top collaborators of Magnus Steinby based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Magnus Steinby. Magnus Steinby is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | Formal Series of General Algebras over a Field and Their Syntactic Algebras. | 1 |
| 4 | 2 | |
| 5 | Varieties of many-sorted recognizable sets | 2 |
| 6 | 7 | |
| 7 | 1 | |
| 8 | Directable nondeterministic automata | 11 |
| 9 | 2 | |
| 10 | 21 | |
| 11 | Some Remarks on Directable Automata. | 6 |
| 12 | 10 | |
| 13 | 0 | |
| 14 | On generalizations of the Nerode and Myhill theorems. | 2 |
| 15 | A theory of tree language varieties. | 20 |
| 16 | A formal theory of errors in tree representations of patterns | 1 |
| 17 | 6 | |
| 18 | Minimal ascending tree automata. | 14 |
| 19 | Proceedings of the Fourth Colloquium on Automata, Languages and Programming | 3 |
| 20 | 1 |
About Magnus Steinby
Magnus Steinby is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Management Science and Operations Research, having authored 22 papers that have together received 116 indexed citations. Recurring topics across this work include semigroups and automata theory (17 papers), Advanced Algebra and Logic (11 papers) and Logic, programming, and type systems (5 papers). The work is most often cited by research in Computational Theory and Mathematics (99 citations), Artificial Intelligence (86 citations) and Algebra and Number Theory (2 citations). Magnus Steinby has collaborated with scholars based in Finland, Spain and Hungary. Frequent co-authors include Ferenc Gécseg, Timo Knuutila, Arto Salomaa, Zoltán Fülöp, Tatjana Petković, Miroslav Ćirić and Stojan Bogdanović. Their work appears in journals such as Theoretical Computer Science, Fundamenta Informaticae and Acta Cybernetica.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.