Friedrich Otto

2.5k total citations
127 papers, 937 citations indexed

About

Friedrich Otto is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Friedrich Otto has authored 127 papers receiving a total of 937 indexed citations (citations by other indexed papers that have themselves been cited), including 108 papers in Computational Theory and Mathematics, 82 papers in Artificial Intelligence and 68 papers in Molecular Biology. Recurrent topics in Friedrich Otto's work include semigroups and automata theory (104 papers), DNA and Biological Computing (65 papers) and Algorithms and Data Compression (30 papers). Friedrich Otto is often cited by papers focused on semigroups and automata theory (104 papers), DNA and Biological Computing (65 papers) and Algorithms and Data Compression (30 papers). Friedrich Otto collaborates with scholars based in Germany, United States and Czechia. Friedrich Otto's co-authors include Ronald V. Book, Paliath Narendran, Klaus Madlener, Yuji Kobayashi, Craig C. Squier, Robert McNaughton, Benedek Nagy, Yuji Kobayashi, Tomasz Jurdziński and František Mráz and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Transactions of the American Mathematical Society.

In The Last Decade

Friedrich Otto

108 papers receiving 872 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Friedrich Otto Germany 14 763 532 366 326 137 127 937
Jean-Éric Pin France 18 968 1.3× 579 1.1× 215 0.6× 166 0.5× 59 0.4× 73 1.0k
Mikhail V. Volkov Russia 15 607 0.8× 193 0.4× 131 0.4× 176 0.5× 36 0.3× 80 633
Jacques Sakarovitch France 12 473 0.6× 334 0.6× 77 0.2× 110 0.3× 54 0.4× 45 528
Jorge Almeida Portugal 18 1.1k 1.5× 455 0.9× 333 0.9× 157 0.5× 96 0.7× 98 1.2k
Pascal Weil France 16 607 0.8× 338 0.6× 166 0.5× 86 0.3× 49 0.4× 55 646
G. S. Makanin Russia 6 240 0.3× 204 0.4× 154 0.4× 26 0.1× 78 0.6× 23 390
Yechezkel Zalcstein United States 12 373 0.5× 201 0.4× 128 0.3× 32 0.1× 21 0.2× 38 467
Denis Thérien Canada 18 879 1.2× 653 1.2× 63 0.2× 88 0.3× 13 0.1× 64 934
W. D. Munn United Kingdom 19 976 1.3× 135 0.3× 417 1.1× 60 0.2× 146 1.1× 70 1.2k
Stefano Varricchio Italy 10 334 0.4× 259 0.5× 35 0.1× 73 0.2× 19 0.1× 46 387

Countries citing papers authored by Friedrich Otto

Since Specialization
Citations

This map shows the geographic impact of Friedrich Otto'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 Friedrich Otto with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Friedrich Otto more than expected).

Fields of papers citing papers by Friedrich Otto

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Friedrich Otto. 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 Friedrich Otto. The network helps show where Friedrich Otto may publish in the future.

Co-authorship network of co-authors of Friedrich Otto

This figure shows the co-authorship network connecting the top 25 collaborators of Friedrich Otto. A scholar is included among the top collaborators of Friedrich Otto 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 Friedrich Otto. Friedrich Otto is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Otto, Friedrich. (2025). Restarting Automata.
2.
Mráz, František & Friedrich Otto. (2019). Window size two suffices for deterministic monotone RWW-automata.. 139–154. 1 indexed citations
3.
Mráz, František, et al.. (2019). Lexicalized Syntactic Analysis by Restarting Automata.. Digital Repository (National Repository of Grey Literature). 69–83.
4.
Otto, Friedrich. (2019). On deterministic ordered restart-delete automata. Theoretical Computer Science. 795. 257–274.
5.
Plátek, Martin, Friedrich Otto, & František Mráz. (2017). On h-Lexicalized Automata and h-Syntactic Analysis.. 40–47.
6.
Mráz, František, Friedrich Otto, & Daniel Průša. (2015). On a class of rational functions for pictures.. 159–176. 2 indexed citations
7.
Otto, Friedrich, et al.. (2012). Systems of Parallel Communicating Restarting Automata.. Kobra (Universitätsbibliothek Kassel). 197–212. 1 indexed citations
8.
Martı́n-Vide, Carlos, Friedrich Otto, & Henning Fernau. (2008). Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Springer eBooks. 2 indexed citations
9.
Jurdziński, Tomasz, Friedrich Otto, František Mráz, & Martin Plátek. (2005). Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundamenta Informaticae. 64(1). 217–228. 2 indexed citations
10.
Otto, Friedrich, et al.. (2004). Shrinking alternating two-pushdown automata. IEICE Transactions on Information and Systems. 87(4). 959–966. 1 indexed citations
11.
Plátek, Martin, Friedrich Otto, & František Mráz. (2003). Restarting Automata and Variants of j-Monotonicity.. 303–312. 2 indexed citations
12.
Otto, Friedrich, et al.. (2003). Reduction relations for monoid semirings. Journal of Symbolic Computation. 37(3). 343–376. 1 indexed citations
13.
Kobayashi, Yuji & Friedrich Otto. (2000). Repetitiveness of languages generated by morphisms. Theoretical Computer Science. 240(2). 337–378. 5 indexed citations
14.
Otto, Friedrich. (1991). When is an extension of a specification consistent? Decidable and undecidable cases. Journal of Symbolic Computation. 12(3). 255–273. 5 indexed citations
15.
Kapur, Deepak, Paliath Narendran, & Friedrich Otto. (1990). On ground-confluence of term rewriting systems. Information and Computation. 86(1). 14–31. 25 indexed citations
16.
Narendran, Paliath & Friedrich Otto. (1989). Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. Theoretical Computer Science. 68(3). 319–332. 4 indexed citations
17.
Narendran, Paliath & Friedrich Otto. (1986). The problems of cyclic equality and conjugacy for finite complete rewriting systems. Theoretical Computer Science. 47. 27–38. 9 indexed citations
18.
Otto, Friedrich. (1985). Elements of finite order for finite monadic Church-Rosser Thue systems. Transactions of the American Mathematical Society. 291(2). 629–637. 8 indexed citations
19.
Otto, Friedrich. (1985). Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems. Transactions of the American Mathematical Society. 291(2). 629–629. 1 indexed citations
20.
Narendran, Paliath, et al.. (1984). The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete. Information and Control. 63(1-2). 58–66. 6 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026