Edit Profile (opens in new tab) Otto, Friedrich Co-Author Distance Author ID: otto.friedrich Published as: Otto, Friedrich; Otto, F. External Links: MGP · dblp Documents Indexed: 241 Publications since 1980, including 3 Books 4 Contributions as Editor · 1 Further Contribution Co-Authors: 59 Co-Authors with 188 Joint Publications 1,139 Co-Co-Authors all top 5 Co-Authors 56 single-authored 39 Mráz, František 24 Plátek, Martin 23 Madlener, Klaus E. 19 Narendran, Paliath 13 Jurdziński, Tomasz 12 Kobayashi, Yuji 10 Messerschmidt, Hartmut 10 Nagy, Benedek 9 Kutrib, Martin 8 Kwee, Kent 8 Niemann, Gundula 5 Book, Ronald Vernon 5 Holzer, Markus 5 Hundeshagen, Norbert 5 Sattler-Klein, Andrea 4 Cremanns, Robert 4 Katsura, Masashi 4 Pardubská, Dana 4 Průša, Daniel 4 Wang, Qichao 3 Hirvensalo, Mika 3 Moriya, Etsuro 3 Stamer, Heiko 2 Beaudry, Martin 2 Bensch, Suna 2 Buntrock, Gerhard 2 Dougherty, Daniel J. 2 Freund, Rudolf 2 Hofbauer, Dieter 2 Kambites, Mark 2 Kuhn, Norbert 2 Pride, Stephen James 2 Squier, Craig C. 2 Vollweiler, Marcel 2 Wendlandt, Matthias 2 Wrathall, Celia 2 Zhang, Louxin 1 Avenhaus, Jürgen 1 Bauer, Günther 1 Benninghofen, Benjamin 1 Bordihn, Henning 1 Černo, Peter 1 Cohen, Daniel E. 1 Diekert, Volker 1 Drewes, Frank 1 Fernau, Henning 1 Hoffmann, Michael 1 Huber, Maria 1 Kapur, Deepak 1 Kemmerich, Susanne 1 Kögl, Christoph 1 Kuske, Dietrich 1 Leupold, Peter 1 Loryś, Krzysztof 1 Martín-Vide, Carlos 1 McNaughton, Robert 1 O’Dunlaing, Colm P. 1 Richter, Michael M. 1 Ruškuc, Nik 1 Séébold, Patrice 1 Sokratova, Olga V. 1 Thomas, Richard M. 1 Winklmann, Karl all top 5 Serials 28 Theoretical Computer Science 10 International Journal of Foundations of Computer Science 9 Journal of Automata, Languages and Combinatorics 9 RAIRO. Theoretical Informatics and Applications 8 Acta Informatica 8 Journal of Symbolic Computation 8 Fundamenta Informaticae 6 Information and Computation 4 Information Processing Letters 4 Mathematical Systems Theory 4 Semigroup Forum 4 Theory of Computing Systems 3 Journal of Computer and System Sciences 3 International Journal of Algebra and Computation 3 RAIRO. Theoretical Informatics and Applications 2 Discrete Mathematics 2 Journal of Algebra 2 Transactions of the American Mathematical Society 2 Journal of Automated Reasoning 2 Applicable Algebra in Engineering, Communication and Computing 2 Lecture Notes in Computer Science 1 Discrete Applied Mathematics 1 Information and Control 1 Journal of the Association for Computing Machinery 1 Journal of the London Mathematical Society. Second Series 1 Journal of Pure and Applied Algebra 1 Revista Colombiana de Matemáticas 1 SIAM Journal on Computing 1 Annales Societatis Mathematicae Polonae. Series IV 1 International Journal of Computer Mathematics 1 RAIRO. Informatique Théorique et Applications 1 Mathematical Logic Quarterly (MLQ) 1 Soft Computing all top 5 Fields 215 Computer science (68-XX) 57 Group theory and generalizations (20-XX) 42 Mathematical logic and foundations (03-XX) 5 Information and communication theory, circuits (94-XX) 4 General and overarching topics; collections (00-XX) 2 Category theory; homological algebra (18-XX) 2 Manifolds and cell complexes (57-XX) 1 General algebraic systems (08-XX) 1 Associative rings and algebras (16-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 184 Publications have been cited 1,349 times in 545 Documents Cited by ▼ Year ▼ String-rewriting systems. Zbl 0832.68061 Book, Ronald V.; Otto, Friedrich 164 1993 A finiteness condition for rewriting systems. Zbl 0863.68082 Squier, Craig C.; Otto, Friedrich; Kobayashi, Yuji 60 1994 Church-Rosser Thue systems and formal languages. Zbl 0652.68093 McNaughton, Robert; Narendran, Paliath; Otto, Friedrich 52 1988 Growing context-sensitive languages and Church-Rosser languages. Zbl 0894.68093 Buntrock, Gerhard; Otto, Friedrich 47 1998 Finite complete rewriting systems and the complexity of word problem. Zbl 0535.68019 Bauer, G.; Otto, F. 32 1984 Conjugacy in monoids with a special Church-Rosser presentation is decidable. Zbl 0551.20044 Otto, Friedrich 32 1984 Finite derivation type implies the homological finiteness condition \(FP_ 3\). Zbl 0834.20065 Cremanns, Robert; Otto, Friedrich 28 1994 On stateless two-pushdown automata and restarting automata. Zbl 1207.68193 Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich 28 2010 The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 1075.68046 Niemann, Gundula; Otto, Friedrich 25 2005 Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Zbl 0591.20038 Madlener, Klaus; Otto, Friedrich 24 1985 For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\). Zbl 0874.20019 Cremanns, Robert; Otto, Friedrich 24 1996 Some undecidability results for non-monadic Church-Rosser Thue systems. Zbl 0563.03019 Otto, Friedrich 19 1984 Systems of reductions. Zbl 0636.68027 Benninghofen, B.; Kemmerich, S.; Richter, M. M. 18 1987 About the descriptive power of certain classes of finite string-rewriting systems. Zbl 0697.20017 Madlener, Klaus; Otto, Friedrich 18 1989 Shrinking restarting automata. Zbl 1112.68087 Jurdziński, Tomasz; Otto, Friedrich 16 2007 Automatic monoids versus monoids with finite convergent presentations. Zbl 0914.20052 Otto, Friedrich; Sattler-Klein, Andrea; Madlener, Klaus 16 1998 Restarting automata and their relations to the Chomsky hierarchy. Zbl 1037.68088 Otto, Friedrich 16 2003 On ground-confluence of term rewriting systems. Zbl 0699.68041 Kapur, Deepak; Narendran, Paliath; Otto, Friedrich 16 1990 Ordered restarting automata for picture languages. Zbl 1432.68237 Mráz, František; Otto, Friedrich 16 2014 On deciding the confluence of a finite string-rewriting system on a given congruence class. Zbl 0645.03033 Otto, Friedrich 14 1987 Some results on RWW-and RRWW-automata and their relation to the class of growing context-sensitive languages. Zbl 1083.68057 Jurdziński, Tomasz; Loryś, Krzysztof; Niemann, Gundula; Otto, Friedrich 14 2004 On deciding whether a monoid is a free monoid or is a group. Zbl 0592.20059 Otto, F. 14 1986 On the descriptional complexity of deterministic ordered restarting automata. Zbl 1416.68108 Otto, Friedrich 13 2014 CD-systems of stateless deterministic \(R(1)\)-automata accept all rational trace languages. Zbl 1284.68363 Nagy, Benedek; Otto, Friedrich 12 2010 Restarting automata, Church-Rosser languages, and representations of {r. e. }languages. Zbl 0980.68068 Niemann, Gundula; Otto, Friedrich 12 2000 Properties of monoids that are presented by finite convergent string-rewriting systems. – A survey. Zbl 0867.68065 Otto, F.; Kobayashi, Y. 12 1997 Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026 Narendran, Paliath; Otto, Friedrich 11 1988 Cooperating distributed systems of restarting automata. Zbl 1183.68347 Messerschmidt, Hartmut; Otto, Friedrich 11 2007 Complexity results on the conjugacy problem for monoids. Zbl 0588.03022 Narendran, Paliath; Otto, Friedrich 11 1985 On homotopical and homological finiteness conditions for finitely presented monoids. Zbl 1026.20058 Kobayashi, Yuji; Otto, Friedrich 11 2001 Degrees of non-monotonicity for restarting automata. Zbl 1142.68423 Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M. 10 2006 The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Zbl 0592.03025 Narendran, Paliath; Otto, Friedrich; Winklmann, Karl 10 1984 Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034 Avenhaus, J.; Madlener, K.; Otto, F. 10 1986 Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Zbl 0699.20047 Otto, Friedrich; Zhang, Louxin 10 1991 For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide. Zbl 1028.20041 Kobayashi, Yuji; Otto, Friedrich 10 2003 McNaughton families of languages. Zbl 1044.68082 Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F. 10 2003 Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group. Zbl 0555.20036 Otto, Friedrich 9 1984 Cancellation rules and extended word problems. Zbl 0561.68030 Book, Ronald V.; Otto, Friedrich 9 1985 For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. Zbl 1072.20066 Pride, Stephen J.; Otto, Friedrich 9 2004 On two problems related to cancellativity. Zbl 0584.20046 Otto, Friedrich 9 1986 Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups. Zbl 0799.03049 Cohen, Daniel E.; Madlener, Klaus; Otto, Friedrich 9 1993 On CD-systems of stateless deterministic R-automata with window size one. Zbl 1279.68167 Nagy, Benedek; Otto, Friedrich 9 2012 Deterministic ordered restarting automata for picture languages. Zbl 1330.68174 Otto, Friedrich; Mráz, František 9 2015 On the effects of nondeterminism on ordered restarting automata. Zbl 1442.68095 Kwee, Kent; Otto, Friedrich 9 2016 On some decision problems for stateless deterministic ordered restarting automata. Zbl 1390.68406 Kwee, Kent; Otto, Friedrich 9 2015 Two-head finite-state acceptors with translucent letters. Zbl 1444.68099 Nagy, Benedek; Otto, Friedrich 9 2019 On deterministic CD-systems of restarting automata. Zbl 1170.68505 Messerschmidt, Hartmut; Otto, Friedrich 8 2009 A note on Thue systems with a single defining relation. Zbl 0601.03015 Otto, Friedrich; Wrathall, Celia 8 1985 The problems of cyclic equality and conjugacy for finite complete rewriting systems. Zbl 0619.68033 Narendran, Paliath; Otto, Friedrich 8 1986 Some relatives of automatic and hyperbolic groups. Zbl 1031.20047 Hoffmann, Michael; Kuske, Dietrich; Otto, Friedrich; Thomas, Richard M. 8 2002 On stateless deterministic restarting automata. Zbl 1214.68198 Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich 8 2010 On s-regular prefix-rewriting systems and automatic structures. Zbl 0944.68086 Otto, Friedrich 7 1999 On Dehn functions of finitely presented bi-automatic monoids. Zbl 0964.68075 Otto, Friedrich 7 2000 Some undecidability results concerning the property of preserving regularity. Zbl 0916.68083 Otto, Friedrich 7 1998 On weakly confluent monadic string-rewriting systems. Zbl 0778.68049 Madlener, K.; Narendran, P.; Otto, F.; Zhang, L. 7 1993 Characterizing the rational functions by restarting transducers. Zbl 1350.68172 Hundeshagen, Norbert; Otto, Friedrich 7 2012 Globally deterministic CD-systems of stateless \(R(1)\)-automata. Zbl 1330.68170 Nagy, Benedek; Otto, Friedrich 7 2011 Two-dimensional Sgraffito automata. Zbl 1328.68117 Průša, Daniel; Mráz, František; Otto, Friedrich 7 2014 Linear automata with translucent letters and linear context-free trace languages. Zbl 1451.68157 Nagy, Benedek; Otto, Friedrich 7 2020 Repetitiveness of languages generated by morphisms. Zbl 0947.68086 Kobayashi, Y.; Otto, F. 6 2000 Monotone deterministic RL-automata don’t need auxiliary symbols. Zbl 1132.68450 Jurdziński, Tomasz; Mráz, František; Otto, Friedrich; Plátek, Martin 6 2005 A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061 Madlener, K.; Narendran, P.; Otto, F. 6 1991 Left-to-right regular languages and two-way restarting automata. Zbl 1176.68107 Otto, Friedrich 6 2009 Globally deterministic CD-systems of stateless R-automata with window size 1. Zbl 1286.68293 Nagy, Benedek; Otto, Friedrich 6 2013 Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265 Otto, Friedrich; Mráz, František 6 2014 Finite canonical rewriting systems for congruences generated by concurrency relations. Zbl 0638.68085 Otto, Friedrich 5 1987 Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025 Narendran, Paliath; Otto, Friedrich 5 1988 On nonforgetting restarting automata that are deterministic and/or monotone. Zbl 1185.68394 Messerschmidt, Hartmut; Otto, Friedrich 5 2006 The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 0908.68089 Niemann, Gundula; Otto, Friedrich 5 1998 Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. Zbl 0920.68064 Otto, Friedrich; Katsura, Masashi; Kobayashi, Yuji 5 1998 Confluent monadic string-rewriting systems and automatic structures. Zbl 0993.68048 Otto, Friedrich; Ruškuc, Nik 5 2001 Uniform decision problems for automatic semigroups. Zbl 1106.20042 Kambites, Mark; Otto, Friedrich 5 2006 Elements of finite order for finite monadic Church-Rosser Thue systems. Zbl 0583.20054 Otto, Friedrich 5 1985 On state-alternating context-free grammars. Zbl 1108.68071 Moriya, Etsuro; Hofbauer, Dieter; Huber, Maria; Otto, Friedrich 5 2005 Overlaps in free partially commutative monoids. Zbl 0719.20030 Otto, Friedrich; Wrathall, Celia 5 1991 Modular properties of monoids and string-rewriting systems. Zbl 1047.68074 Otto, Friedrich 5 1999 Some results on equational unification. Zbl 1509.68122 Narendran, Paliath; Otto, Friedrich 5 1990 Groups presented by certain classes of finite length-reducing string- rewriting systems. Zbl 0636.20022 Madlener, Klaus; Otto, Friedrich 4 1987 Commutativity in groups presented by finite Church-Rosser Thue systems. Zbl 0649.20030 Madlener, Klaus; Otto, Friedrich 4 1988 Strictly deterministic CD-systems of restarting automata. Zbl 1135.68458 Messerschmidt, H.; Otto, F. 4 2007 On the complexity of 2-monotone restarting automata. Zbl 1140.68034 Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin 4 2008 Characterizing the regular languages by nonforgetting restarting automata. Zbl 1221.68133 Hundeshagen, Norbert; Otto, Friedrich 4 2011 The word problem for finitely presented monoids and finite canonical rewriting systems. Zbl 0625.03023 Squier, Craig; Otto, Friedrich 4 1987 Cd-systems of stateless deterministic \(r(1)\)-automata governed by an external pushdown store. Zbl 1250.68172 Nagy, Benedek; Otto, Friedrich 4 2011 Classes of regular and context-free languages over countably infinite alphabets. Zbl 0582.68046 Otto, Friedrich 4 1985 Church-Rosser Thue systems that present free monoids. Zbl 0599.20091 Otto, Friedrich 4 1986 Deterministic two-way restarting automata and Marcus contextual grammars. Zbl 1102.68043 Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin 4 2005 Hierarchies of weakly monotone restarting automata. Zbl 1101.68587 Mráz, František; Otto, Friedrich 4 2005 It is undecidable whether a finite special string-rewriting system presents a group. Zbl 0749.20032 Narendran, Paliath; Ó’Dúnlaing, Colm; Otto, Friedrich 4 1991 When is an extension of a specification consistent? Decidable and undecidable cases. Zbl 0746.68062 Otto, Friedrich 4 1991 The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. Zbl 0780.68080 Otto, Friedrich 4 1992 Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general. Zbl 0875.68593 Otto, Friedrich 4 1995 Restarting automata for picture languages: a survey on recent developments. Zbl 1302.68174 Otto, Friedrich 4 2014 Weighted restarting automata and pushdown relations. Zbl 1465.68167 Wang, Qichao; Hundeshagen, Norbert; Otto, Friedrich 4 2015 Some exact sequences for the homotopy (bi-)module of a monoid. Zbl 1030.20043 Kobayashi, Yuji; Otto, Friedrich 4 2002 New results on deterministic sgraffito automata. Zbl 1381.68132 Průša, Daniel; Mráz, František; Otto, Friedrich 4 2013 Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154 Průša, Daniel; Mráz, František; Otto, Friedrich 4 2013 Weighted restarting automata. Zbl 1398.68325 Otto, Friedrich; Wang, Qichao 4 2018 On deterministic ordered restart-delete automata. Zbl 1517.68210 Otto, Friedrich 4 2018 On groups having finite monadic Church-Rosser presentations. Zbl 0672.20015 Madlener, Klaus; Otto, Friedrich 3 1988 Recognizing picture languages by reductions to string languages. Zbl 07584603 Mráz, František; Otto, Friedrich 1 2022 On restarting automata with auxiliary symbols and small window size. Zbl 1508.68200 Mráz, František; Otto, Friedrich 1 2021 Linear automata with translucent letters and linear context-free trace languages. Zbl 1451.68157 Nagy, Benedek; Otto, Friedrich 7 2020 A characterization of the context-free languages by stateless ordered restart-delete automata. Zbl 1440.68160 Otto, Friedrich 1 2020 On two-sided locally testable languages. Zbl 1503.68175 Kutrib, Martin; Otto, Friedrich 1 2020 On h-lexicalized restarting list automata. Zbl 1462.68110 Plátek, Martin; Otto, Friedrich; Mráz, František 1 2020 Two-head finite-state acceptors with translucent letters. Zbl 1444.68099 Nagy, Benedek; Otto, Friedrich 9 2019 On deterministic ordered restart-delete automata. Zbl 1431.68060 Otto, Friedrich 3 2019 On shrinking restarting automata of window size one and two. Zbl 07117542 Mráz, František; Otto, Friedrich 1 2019 Weighted restarting automata. Zbl 1398.68325 Otto, Friedrich; Wang, Qichao 4 2018 On deterministic ordered restart-delete automata. Zbl 1517.68210 Otto, Friedrich 4 2018 On the descriptional complexity of stateless deterministic ordered restarting automata. Zbl 1390.68412 Otto, Friedrich; Kwee, Kent 3 2018 Nondeterministic ordered restarting automata. Zbl 1397.68117 Kwee, Kent; Otto, Friedrich 3 2018 On h-lexicalized restarting automata. Zbl 1483.68180 Plátek, Martin; Otto, Friedrich 2 2017 A pumping lemma for ordered restarting automata. Zbl 1489.68128 Kwee, Kent; Otto, Friedrich 1 2017 On the effects of nondeterminism on ordered restarting automata. Zbl 1442.68095 Kwee, Kent; Otto, Friedrich 9 2016 Weighted restarting automata as language acceptors. Zbl 1475.68168 Wang, Qichao; Otto, Friedrich 2 2016 Weighted restarting automata and pushdown relations. Zbl 1454.68063 Wang, Qichao; Otto, Friedrich 2 2016 On ordered RRWW-automata. Zbl 1436.68179 Kwee, Kent; Otto, Friedrich 2 2016 Some classes of rational functions for pictures. Zbl 1362.68152 Mráz, František; Otto, Friedrich; Průša, Daniel 1 2016 Deterministic ordered restarting automata for picture languages. Zbl 1330.68174 Otto, Friedrich; Mráz, František 9 2015 On some decision problems for stateless deterministic ordered restarting automata. Zbl 1390.68406 Kwee, Kent; Otto, Friedrich 9 2015 Weighted restarting automata and pushdown relations. Zbl 1465.68167 Wang, Qichao; Hundeshagen, Norbert; Otto, Friedrich 4 2015 Reversible ordered restarting automata. Zbl 1464.68181 Otto, Friedrich; Wendlandt, Matthias; Kwee, Kent 3 2015 Deterministic ordered restarting automata that compute functions. Zbl 1434.68283 Otto, Friedrich; Kwee, Kent 2 2015 On visibly pushdown trace languages. Zbl 1432.68240 Otto, Friedrich 2 2015 Restarting transducers, regular languages, and rational relations. Zbl 1339.68149 Hundeshagen, Norbert; Otto, Friedrich 1 2015 Ordered restarting automata for picture languages. Zbl 1432.68237 Mráz, František; Otto, Friedrich 16 2014 On the descriptional complexity of deterministic ordered restarting automata. Zbl 1416.68108 Otto, Friedrich 13 2014 Two-dimensional Sgraffito automata. Zbl 1328.68117 Průša, Daniel; Mráz, František; Otto, Friedrich 7 2014 Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265 Otto, Friedrich; Mráz, František 6 2014 Restarting automata for picture languages: a survey on recent developments. Zbl 1302.68174 Otto, Friedrich 4 2014 On the classes of languages accepted by limited context restarting automata. Zbl 1366.68149 Otto, Friedrich; Černo, Peter; Mráz, František 3 2014 Systems of parallel communicating restarting automata. Zbl 1366.68153 Vollweiler, Marcel; Otto, Friedrich 1 2014 Free word-order and restarting automata. Zbl 1315.68170 Mráz, František; Otto, Friedrich; Plátek, Martin 1 2014 Globally deterministic CD-systems of stateless R-automata with window size 1. Zbl 1286.68293 Nagy, Benedek; Otto, Friedrich 6 2013 New results on deterministic sgraffito automata. Zbl 1381.68132 Průša, Daniel; Mráz, František; Otto, Friedrich 4 2013 Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154 Průša, Daniel; Mráz, František; Otto, Friedrich 4 2013 On the descriptional complexity of the window size for deleting restarting automata. Zbl 1309.68121 Kutrib, Martin; Otto, Friedrich 3 2013 Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Zbl 1359.68177 Nagy, Benedek; Otto, Friedrich 1 2013 Lambda-confluence is undecidable for clearing restarting automata. Zbl 1298.68151 Mráz, František; Otto, Friedrich 1 2013 On CD-systems of stateless deterministic R-automata with window size one. Zbl 1279.68167 Nagy, Benedek; Otto, Friedrich 9 2012 Characterizing the rational functions by restarting transducers. Zbl 1350.68172 Hundeshagen, Norbert; Otto, Friedrich 7 2012 Globally deterministic CD-systems of stateless \(R(1)\)-automata. Zbl 1330.68170 Nagy, Benedek; Otto, Friedrich 7 2011 Characterizing the regular languages by nonforgetting restarting automata. Zbl 1221.68133 Hundeshagen, Norbert; Otto, Friedrich 4 2011 Cd-systems of stateless deterministic \(r(1)\)-automata governed by an external pushdown store. Zbl 1250.68172 Nagy, Benedek; Otto, Friedrich 4 2011 An automata-theoretical characterization of context-free trace languages. Zbl 1298.68152 Nagy, Benedek; Otto, Friedrich 3 2011 A hierarchy of monotone deterministic non-forgetting restarting automata. Zbl 1209.68303 Messerschmidt, Hartmut; Otto, Friedrich 3 2011 Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Zbl 1341.68103 Nagy, Benedek; Otto, Friedrich 3 2011 Transductions computed by PC-systems of monotone deterministic restarting automata. Zbl 1297.68138 Hundeshagen, Norbert; Otto, Friedrich; Vollweiler, Marcel 1 2011 On stateless two-pushdown automata and restarting automata. Zbl 1207.68193 Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich 28 2010 CD-systems of stateless deterministic \(R(1)\)-automata accept all rational trace languages. Zbl 1284.68363 Nagy, Benedek; Otto, Friedrich 12 2010 On stateless deterministic restarting automata. Zbl 1214.68198 Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich 8 2010 On lexicalized well-behaved restarting automata that are monotone. Zbl 1250.68173 Otto, Friedrich; Plátek, Martin; Mráz, František 2 2010 On deterministic CD-systems of restarting automata. Zbl 1170.68505 Messerschmidt, Hartmut; Otto, Friedrich 8 2009 Left-to-right regular languages and two-way restarting automata. Zbl 1176.68107 Otto, Friedrich 6 2009 The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Zbl 1191.68399 Mráz, F.; Otto, F.; Plátek, M. 3 2009 On stateless deterministic restarting automata. Zbl 1206.68116 Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich 3 2009 Single-path restarting tree automata. Zbl 1256.68110 Otto, Friedrich; Stamer, Heiko 1 2009 Parallel communicating grammar systems with regular control. Zbl 1256.68092 Pardubská, Dana; Plátek, Martin; Otto, Friedrich 1 2009 On parallel communicating grammar systems and correctness preserving restarting automata. Zbl 1234.68234 Pardubská, Dana; Plátek, Martin; Otto, Friedrich 1 2009 On the complexity of 2-monotone restarting automata. Zbl 1140.68034 Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin 4 2008 On determinism versus nondeterminism for restarting automata. Zbl 1328.68114 Messerschmidt, Hartmut; Otto, Friedrich 1 2008 Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13–19, 2008. Revised papers. Zbl 1148.68005 1 2008 A two-dimensional taxonomy of proper languages of lexicalized FRR-automata. Zbl 1156.68462 Otto, Friedrich; Plátek, Martin 1 2008 Shrinking restarting automata. Zbl 1112.68087 Jurdziński, Tomasz; Otto, Friedrich 16 2007 Cooperating distributed systems of restarting automata. Zbl 1183.68347 Messerschmidt, Hartmut; Otto, Friedrich 11 2007 Strictly deterministic CD-systems of restarting automata. Zbl 1135.68458 Messerschmidt, H.; Otto, F. 4 2007 Restarting tree automata and linear context-free tree languages. Zbl 1148.68403 Stamer, Heiko; Otto, Friedrich 2 2007 Restarting tree automata. Zbl 1132.68040 Stamer, Heiko; Otto, Friedrich 1 2007 Some decidability and undecidability results on Green’s relations for automatic monoids. Zbl 1138.20048 Otto, Friedrich 1 2007 Degrees of non-monotonicity for restarting automata. Zbl 1142.68423 Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M. 10 2006 On nonforgetting restarting automata that are deterministic and/or monotone. Zbl 1185.68394 Messerschmidt, Hartmut; Otto, Friedrich 5 2006 Uniform decision problems for automatic semigroups. Zbl 1106.20042 Kambites, Mark; Otto, Friedrich 5 2006 Restarting automata with restricted utilization of auxiliary symbols. Zbl 1153.68031 Jurdziński, Tomasz; Otto, Friedrich 2 2006 Learning analysis by reduction from positive data. Zbl 1158.68412 Mráz, František; Otto, Friedrich; Plátek, Martin 2 2006 Correctness preservation and complexity of simple RL-automata. Zbl 1160.68424 Messerschmidt, H.; Mráz, F.; Otto, F.; Plátek, M. 1 2006 On the gap-complexity of simple RL-automata. Zbl 1227.68065 Mráz, F.; Otto, F.; Plátek, M. 1 2006 The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 1075.68046 Niemann, Gundula; Otto, Friedrich 25 2005 Monotone deterministic RL-automata don’t need auxiliary symbols. Zbl 1132.68450 Jurdziński, Tomasz; Mráz, František; Otto, Friedrich; Plátek, Martin 6 2005 On state-alternating context-free grammars. Zbl 1108.68071 Moriya, Etsuro; Hofbauer, Dieter; Huber, Maria; Otto, Friedrich 5 2005 Deterministic two-way restarting automata and Marcus contextual grammars. Zbl 1102.68043 Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin 4 2005 Hierarchies of weakly monotone restarting automata. Zbl 1101.68587 Mráz, František; Otto, Friedrich 4 2005 On higher order homological finiteness of rewriting systems. Zbl 1074.20035 Pride, Stephen J.; Otto, Friedrich 3 2005 Shrinking multi-pushdown automata. Zbl 1123.68060 Holzer, Markus; Otto, Friedrich 1 2005 Some results on RWW-and RRWW-automata and their relation to the class of growing context-sensitive languages. Zbl 1083.68057 Jurdziński, Tomasz; Loryś, Krzysztof; Niemann, Gundula; Otto, Friedrich 14 2004 For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. Zbl 1072.20066 Pride, Stephen J.; Otto, Friedrich 9 2004 On left-monotone deterministic restarting automata. Zbl 1117.68405 Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M. 3 2004 Reduction relations for monoid semirings. Zbl 1121.68350 Otto, Friedrich; Sokratova, Olga 2 2004 On the complexity of 2-monotone restarting automata. Zbl 1117.68404 Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M. 1 2004 Restarting automata and their relations to the Chomsky hierarchy. Zbl 1037.68088 Otto, Friedrich 16 2003 For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide. Zbl 1028.20041 Kobayashi, Yuji; Otto, Friedrich 10 2003 McNaughton families of languages. Zbl 1044.68082 Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F. 10 2003 Some relatives of automatic and hyperbolic groups. Zbl 1031.20047 Hoffmann, Michael; Kuske, Dietrich; Otto, Friedrich; Thomas, Richard M. 8 2002 Some exact sequences for the homotopy (bi-)module of a monoid. Zbl 1030.20043 Kobayashi, Yuji; Otto, Friedrich 4 2002 On the relationship between the McNaughton families of languages and the Chomsky hierarchy. Zbl 1073.68040 Beaudry, M.; Holzer, M.; Niemann, Gundula; Otto, F. 1 2002 A completion procedure for finitely presented groups that is based on word cycles. Zbl 1002.68080 Cremanns, Robert; Otto, Friedrich 1 2002 On homotopical and homological finiteness conditions for finitely presented monoids. Zbl 1026.20058 Kobayashi, Yuji; Otto, Friedrich 11 2001 Confluent monadic string-rewriting systems and automatic structures. Zbl 0993.68048 Otto, Friedrich; Ruškuc, Nik 5 2001 On the power of RRWW-automata. Zbl 1499.68191 Niemann, Gundula; Otto, Friedrich 3 2001 ...and 84 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 447 Authors 118 Otto, Friedrich 24 Kutrib, Martin 21 Mráz, František 18 Malheiro, António 17 Cain, Alan J. 17 Narendran, Paliath 16 Gray, Robert D. 15 Kobayashi, Yuji 13 Diekert, Volker 13 Nagy, Benedek 12 Lohrey, Markus 12 Malbos, Philippe 12 Malcher, Andreas 12 Sénizergues, Géraud 11 Plátek, Martin 9 Madlener, Klaus E. 9 Thomas, Richard M. 9 Wendlandt, Matthias 8 Jurdziński, Tomasz 8 Kambites, Mark 8 Nyberg-Brodda, Carl-Fredrik 8 Ruškuc, Nik 8 Vágvölgyi, Sándor 8 Zhang, Louxin 7 Hofbauer, Dieter 7 Holzer, Markus 7 Lafont, Yves 7 Messerschmidt, Hartmut 7 Steinberg, Benjamin 6 Geser, Alfons 6 Kwee, Kent 6 Pride, Stephen James 6 Průša, Daniel 6 Silva, Pedro V. 6 Waldmann, Johannes 6 Wang, Qichao 5 Book, Ronald Vernon 5 Karpuz, Eylem Güzel 5 Konieczny, Janusz 5 Leupold, Peter 5 Maltcev, Victor 5 Ol’shanskiĭ, Aleksandr Yur’evich 5 Piggott, Adam 4 Araújo, João 4 Birget, Jean-Camille 4 Çevik, Ahmet Sinan 4 Crespi Reghizzi, Stefano 4 Guiraud, Yves 4 Hermiller, Susan M. 4 Hundeshagen, Norbert 4 Ibarra, Oscar H. 4 Kapur, Deepak 4 Katsura, Masashi 4 Krieger, Dalia 4 Madonia, Maria 4 Sapir, Mark Valentinovich 3 Anselmo, Marcella 3 Egecioglu, Omer 3 Elder, Murray J. 3 Engelfriet, Joost 3 Giammarresi, Dora 3 Gilbert, Nick D. 3 Goubault, Eric 3 Klouda, Karel 3 Lonati, Violetta 3 Meduna, Alexander 3 Mitrana, Victor 3 Moriya, Etsuro 3 O’Dunlaing, Colm P. 3 Pardubská, Dana 3 Parray, Mohd Rafiq 3 Shah, Aftab Hussain 3 Wang, Xiaofeng 3 Weiß, Armin 3 Zantema, Hans 2 Ateş, Firat 2 Avenhaus, Jürgen 2 Bauer, Günther 2 Bonchi, Filippo 2 Bordihn, Henning 2 Bouajjani, Ahmed 2 Boy de la Tour, Thierry 2 Brittenham, Mark 2 Brown, Ronald 2 Calk, Cameron 2 Cangul, Ismail Naci 2 Çetinalp, Esra Kirmizi 2 Chenavier, Cyrille 2 Chouraqui, Fabienne 2 Descalço, L. 2 Dougherty, Daniel J. 2 Drewes, Frank 2 Dupont, Benjamin 2 Echahed, Rachid 2 Esparza, Javier 2 Gadducci, Fabio 2 Gomes, Gracinda M. S. 2 Gould, Victoria A. R. 2 Guba, Victor S. 2 Gyenizse, Pál ...and 347 more Authors all top 5 Cited in 91 Serials 98 Theoretical Computer Science 31 International Journal of Algebra and Computation 29 Journal of Algebra 27 Information and Computation 24 International Journal of Foundations of Computer Science 19 Journal of Symbolic Computation 18 Semigroup Forum 14 Journal of Pure and Applied Algebra 13 Acta Informatica 11 Communications in Algebra 11 Information Processing Letters 11 RAIRO. Theoretical Informatics and Applications 7 Transactions of the American Mathematical Society 7 MSCS. Mathematical Structures in Computer Science 7 Theory of Computing Systems 6 Mathematical Systems Theory 6 RAIRO. Theoretical Informatics and Applications 5 Journal of Computer and System Sciences 5 Journal of Automata, Languages and Combinatorics 5 Fundamenta Informaticae 4 Discrete Mathematics 4 International Journal of Computer Mathematics 4 Applicable Algebra in Engineering, Communication and Computing 4 Algebras and Representation Theory 4 Natural Computing 3 Discrete Applied Mathematics 3 Monatshefte für Mathematik 3 Journal of Automated Reasoning 3 Asian-European Journal of Mathematics 2 Bulletin of the Australian Mathematical Society 2 Beiträge zur Algebra und Geometrie 2 Advances in Mathematics 2 Annales de l’Institut Fourier 2 Machine Learning 2 RAIRO. Informatique Théorique et Applications 2 Formal Methods in System Design 2 Algebraic & Geometric Topology 2 The Journal of Logic and Algebraic Programming 2 Journal of the Australian Mathematical Society 2 Journal of Algebra and its Applications 2 Logical Methods in Computer Science 2 Bulletin of Mathematical Sciences 2 Algebraic Structures and their Applications 1 Communications in Mathematical Physics 1 Mathematical Notes 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Problems of Information Transmission 1 Rocky Mountain Journal of Mathematics 1 The Mathematical Intelligencer 1 Acta Scientiarum Mathematicarum 1 Applied Mathematics and Computation 1 Compositio Mathematica 1 Geometriae Dedicata 1 Information Sciences 1 Inventiones Mathematicae 1 Journal of Combinatorial Theory. Series A 1 Journal of the London Mathematical Society. Second Series 1 Kybernetika 1 Mathematische Zeitschrift 1 Memoirs of the American Mathematical Society 1 Proceedings of the American Mathematical Society 1 Publications de l’Institut Mathématique. Nouvelle Série 1 Journal of Computer Science and Technology 1 Forum Mathematicum 1 Distributed Computing 1 Computational Complexity 1 Journal of Algebraic Combinatorics 1 Applied Categorical Structures 1 Algebra Colloquium 1 Turkish Journal of Mathematics 1 Selecta Mathematica. New Series 1 Soft Computing 1 Journal of Graph Algorithms and Applications 1 Journal of Group Theory 1 Communications de la Faculté des Sciences de l’Université d’Ankara. Séries A1. Mathematics and Statistics 1 Comptes Rendus. Mathématique. Académie des Sciences, Paris 1 Journal of Discrete Algorithms 1 Journal of Applied Logic 1 Fixed Point Theory and Applications 1 Oberwolfach Reports 1 Groups, Geometry, and Dynamics 1 Groups, Complexity, Cryptology 1 Cryptography and Communications 1 Asian Journal of Control 1 ISRN Combinatorics 1 Electronic Journal of Graph Theory and Applications 1 Open Mathematics 1 Korean Journal of Mathematics 1 Journal of Combinatorial Algebra 1 Algebraic Combinatorics 1 British Journal for the History of Mathematics all top 5 Cited in 26 Fields 427 Computer science (68-XX) 219 Group theory and generalizations (20-XX) 87 Mathematical logic and foundations (03-XX) 30 Combinatorics (05-XX) 23 Category theory; homological algebra (18-XX) 14 Manifolds and cell complexes (57-XX) 13 Associative rings and algebras (16-XX) 13 Information and communication theory, circuits (94-XX) 8 Commutative algebra (13-XX) 6 General algebraic systems (08-XX) 6 Number theory (11-XX) 5 Algebraic topology (55-XX) 3 History and biography (01-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 2 Dynamical systems and ergodic theory (37-XX) 2 Biology and other natural sciences (92-XX) 1 General and overarching topics; collections (00-XX) 1 Field theory and polynomials (12-XX) 1 Algebraic geometry (14-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Nonassociative rings and algebras (17-XX) 1 Functional analysis (46-XX) 1 Convex and discrete geometry (52-XX) 1 General topology (54-XX) 1 Statistics (62-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year