×

zbMATH — the first resource for mathematics

Otto, Friedrich

Compute Distance To:
Author ID: otto.friedrich Recent zbMATH articles by "Otto, Friedrich"
Published as: Otto, Friedrich; Otto, F.
External Links: MGP · dblp
Documents Indexed: 231 Publications since 1980, including 5 Books

Publications by Year

Citations contained in zbMATH Open

166 Publications have been cited 1,054 times in 426 Documents Cited by Year
String-rewriting systems. Zbl 0832.68061
Book, Ronald V.; Otto, Friedrich
123
1993
A finiteness condition for rewriting systems. Zbl 0863.68082
Squier, Craig C.; Otto, Friedrich; Kobayashi, Yuji
47
1994
Church-Rosser Thue systems and formal languages. Zbl 0652.68093
McNaughton, Robert; Narendran, Paliath; Otto, Friedrich
45
1988
Growing context-sensitive languages and Church-Rosser languages. Zbl 0894.68093
Buntrock, Gerhard; Otto, Friedrich
38
1998
Finite complete rewriting systems and the complexity of word problem. Zbl 0535.68019
Bauer, G.; Otto, F.
27
1984
Conjugacy in monoids with a special Church-Rosser presentation is decidable. Zbl 0551.20044
Otto, Friedrich
26
1984
Finite derivation type implies the homological finiteness condition \(FP_ 3\). Zbl 0834.20065
Cremanns, Robert; Otto, Friedrich
25
1994
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
22
1996
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Zbl 0591.20038
Madlener, Klaus; Otto, Friedrich
21
1985
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 1075.68046
Niemann, Gundula; Otto, Friedrich
19
2005
On stateless two-pushdown automata and restarting automata. Zbl 1207.68193
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich
19
2010
Some undecidability results for non-monadic Church-Rosser Thue systems. Zbl 0563.03019
Otto, Friedrich
17
1984
About the descriptive power of certain classes of finite string-rewriting systems. Zbl 0697.20017
Madlener, Klaus; Otto, Friedrich
17
1989
Automatic monoids versus monoids with finite convergent presentations. Zbl 0914.20052
Otto, Friedrich; Sattler-Klein, Andrea; Madlener, Klaus
14
1998
On deciding whether a monoid is a free monoid or is a group. Zbl 0592.20059
Otto, F.
14
1986
Restarting automata and their relations to the Chomsky hierarchy. Zbl 1037.68088
Otto, Friedrich
13
2003
On deciding the confluence of a finite string-rewriting system on a given congruence class. Zbl 0645.03033
Otto, Friedrich
13
1987
Shrinking restarting automata. Zbl 1112.68087
Jurdziński, Tomasz; Otto, Friedrich
13
2007
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
11
2004
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
Properties of monoids that are presented by finite convergent string-rewriting systems. – A survey. Zbl 0867.68065
Otto, F.; Kobayashi, Y.
10
1997
On homotopical and homological finiteness conditions for finitely presented monoids. Zbl 1026.20058
Kobayashi, Yuji; Otto, Friedrich
10
2001
Restarting automata, Church-Rosser languages, and representations of {r. e. }languages. Zbl 0980.68068
Niemann, Gundula; Otto, Friedrich
10
2000
Ordered restarting automata for picture languages. Zbl 1432.68237
Mráz, František; Otto, Friedrich
10
2014
On the descriptional complexity of deterministic ordered restarting automata. Zbl 1416.68108
Otto, Friedrich
10
2014
The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete. Zbl 0592.03025
Narendran, Paliath; Otto, Friedrich; Winklmann, Karl
10
1984
For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide. Zbl 1028.20041
Kobayashi, Yuji; Otto, Friedrich
9
2003
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule. Zbl 0653.03026
Narendran, Paliath; Otto, Friedrich
9
1988
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
Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Zbl 0699.20047
Otto, Friedrich; Zhang, Louxin
9
1991
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
9
1990
Groups presented by finite two-monadic Church-Rosser Thue systems. Zbl 0604.20034
Avenhaus, J.; Madlener, K.; Otto, F.
8
1986
The problems of cyclic equality and conjugacy for finite complete rewriting systems. Zbl 0619.68033
Narendran, Paliath; Otto, Friedrich
8
1986
On deterministic CD-systems of restarting automata. Zbl 1170.68505
Messerschmidt, Hartmut; Otto, Friedrich
8
2009
CD-systems of stateless deterministic \(R(1)\)-automata accept all rational trace languages. Zbl 1284.68363
Nagy, Benedek; Otto, Friedrich
8
2010
On some decision problems for stateless deterministic ordered restarting automata. Zbl 1390.68406
Kwee, Kent; Otto, Friedrich
8
2015
On the effects of nondeterminism on ordered restarting automata. Zbl 1442.68095
Kwee, Kent; Otto, Friedrich
8
2016
Some undecidability results concerning the property of preserving regularity. Zbl 0916.68083
Otto, Friedrich
7
1998
For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. Zbl 1072.20066
Pride, Stephen J.; Otto, Friedrich
7
2004
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
7
1993
Some relatives of automatic and hyperbolic groups. Zbl 1031.20047
Hoffmann, Michael; Kuske, Dietrich; Otto, Friedrich; Thomas, Richard M.
7
2002
McNaughton families of languages. Zbl 1044.68082
Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F.
7
2003
A note on Thue systems with a single defining relation. Zbl 0601.03015
Otto, Friedrich; Wrathall, Celia
7
1985
Degrees of non-monotonicity for restarting automata. Zbl 1142.68423
Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M.
7
2006
On stateless deterministic restarting automata. Zbl 1214.68198
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich
7
2010
On s-regular prefix-rewriting systems and automatic structures. Zbl 0944.68086
Otto, Friedrich
6
1999
On Dehn functions of finitely presented bi-automatic monoids. Zbl 0964.68075
Otto, Friedrich
6
2000
On two problems related to cancellativity. Zbl 0584.20046
Otto, Friedrich
6
1986
Uniform decision problems for automatic semigroups. Zbl 1106.20042
Kambites, Mark; Otto, Friedrich
5
2006
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. Zbl 0920.68064
Otto, Friedrich; Katsura, Masashi; Kobayashi, Yuji
5
1998
On weakly confluent monadic string-rewriting systems. Zbl 0778.68049
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L.
5
1993
Repetitiveness of languages generated by morphisms. Zbl 0947.68086
Kobayashi, Y.; Otto, F.
5
2000
Confluent monadic string-rewriting systems and automatic structures. Zbl 0993.68048
Otto, Friedrich; Ruškuc, Nik
5
2001
On nonforgetting restarting automata that are deterministic and/or monotone. Zbl 1185.68394
Messerschmidt, Hartmut; Otto, Friedrich
5
2006
Deterministic ordered restarting automata for picture languages. Zbl 1330.68174
Otto, Friedrich; Mráz, František
5
2015
Elements of finite order for finite monadic Church-Rosser Thue systems. Zbl 0583.20054
Otto, Friedrich
5
1985
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 0908.68089
Niemann, Gundula; Otto, Friedrich
4
1998
Some exact sequences for the homotopy (bi-)module of a monoid. Zbl 1030.20043
Kobayashi, Yuji; Otto, Friedrich
4
2002
Modular properties of monoids and string-rewriting systems. Zbl 1047.68074
Otto, Friedrich
4
1999
Church-Rosser Thue systems that present free monoids. Zbl 0599.20091
Otto, Friedrich
4
1986
Finite canonical rewriting systems for congruences generated by concurrency relations. Zbl 0638.68085
Otto, Friedrich
4
1987
A specialized completion procedure for monadic string-rewriting systems presenting groups. Zbl 0769.68061
Madlener, K.; Narendran, P.; Otto, F.
4
1991
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
Monotone deterministic RL-automata don’t need auxiliary symbols. Zbl 1132.68450
Jurdziński, Tomasz; Mráz, František; Otto, Friedrich; Plátek, Martin
4
2005
On state-alternating context-free grammars. Zbl 1108.68071
Moriya, Etsuro; Hofbauer, Dieter; Huber, Maria; Otto, Friedrich
4
2005
Characterizing the rational functions by restarting transducers. Zbl 1350.68172
Hundeshagen, Norbert; Otto, Friedrich
4
2012
On CD-systems of stateless deterministic R-automata with window size one. Zbl 1279.68167
Nagy, Benedek; Otto, Friedrich
4
2012
Left-to-right regular languages and two-way restarting automata. Zbl 1176.68107
Otto, Friedrich
4
2009
Two-dimensional Sgraffito automata. Zbl 1328.68117
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2014
Strictly deterministic CD-systems of restarting automata. Zbl 1135.68458
Messerschmidt, H.; Otto, F.
4
2007
Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265
Otto, Friedrich; Mráz, František
4
2014
Classes of regular and context-free languages over countably infinite alphabets. Zbl 0582.68046
Otto, Friedrich
4
1985
Elements of finite order for finite weight-reducing and confluent Thue systems. Zbl 0673.68025
Narendran, Paliath; Otto, Friedrich
4
1988
A complete characterization of repetitive morphisms over the two-letter alphabet. Zbl 0884.68073
Kobayashi, Yuji; Otto, Friedrich; Séébold, Patrice
3
1997
Computing presentations for subgroups of polycyclic groups and of context-free groups. Zbl 0807.20030
Kuhn, Norbert; Madlener, Klaus; Otto, Friedrich
3
1994
Hierarchies of weakly monotone restarting automata. Zbl 1101.68587
Mráz, František; Otto, Friedrich
3
2005
The word problem for finitely presented monoids and finite canonical rewriting systems. Zbl 0625.03023
Squier, Craig; Otto, Friedrich
3
1987
Decidable sentences for context-free groups. Zbl 0764.68086
Madlener, Klaus; Otto, Friedrich
3
1991
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general. Zbl 0875.68593
Otto, Friedrich
3
1995
Completing a finite special string-rewriting system on the congruence class of the empty word. Zbl 0746.68048
Otto, Friedrich
3
1992
The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. Zbl 0780.68080
Otto, Friedrich
3
1992
Deterministic two-way restarting automata and Marcus contextual grammars. Zbl 1102.68043
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
3
2005
New results on deterministic sgraffito automata. Zbl 1381.68132
Průša, Daniel; Mráz, František; Otto, Friedrich
3
2013
Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154
Průša, Daniel; Mráz, František; Otto, Friedrich
3
2013
On deterministic ordered restart-delete automata. Zbl 06983405
Otto, Friedrich
3
2018
On the descriptional complexity of stateless deterministic ordered restarting automata. Zbl 1390.68412
Otto, Friedrich; Kwee, Kent
3
2018
On stateless deterministic restarting automata. Zbl 1206.68116
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich
3
2009
Globally deterministic CD-systems of stateless \(R(1)\)-automata. Zbl 1330.68170
Nagy, Benedek; Otto, Friedrich
3
2011
Characterizing the regular languages by nonforgetting restarting automata. Zbl 1221.68133
Hundeshagen, Norbert; Otto, Friedrich
3
2011
On the classes of languages accepted by limited context restarting automata. Zbl 1366.68149
Otto, Friedrich; Černo, Peter; Mráz, František
3
2014
Weighted restarting automata and pushdown relations. Zbl 1465.68167
Wang, Qichao; Hundeshagen, Norbert; Otto, Friedrich
3
2015
On the complexity of 2-monotone restarting automata. Zbl 1140.68034
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
3
2008
Overlaps in free partially commutative monoids. Zbl 0719.20030
Otto, Friedrich; Wrathall, Celia
3
1991
Some undecidability results for finitely generated Thue congruences on a two-letter alphabet. Zbl 0888.68079
Madlener, Klaus; Otto, Friedrich
2
1997
Single versus simultaneous equational unification and equational unification for variable-permuting theories. Zbl 0882.68079
Narendran, Paliath; Otto, Friedrich
2
1997
The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems. Zbl 1029.20028
Otto, F.; Sattler-Klein, A.
2
2000
On the verifiability of two-party algebraic protocols. Zbl 0603.94008
Book, Ronald V.; Otto, Friedrich
2
1985
Linear automata with translucent letters and linear context-free trace languages. Zbl 1451.68157
Nagy, Benedek; Otto, Friedrich
1
2020
On two-sided locally testable languages. Zbl 07347655
Kutrib, Martin; Otto, Friedrich
1
2020
On deterministic ordered restart-delete automata. Zbl 1431.68060
Otto, Friedrich
2
2019
Two-head finite-state acceptors with translucent letters. Zbl 1444.68099
Nagy, Benedek; Otto, Friedrich
1
2019
On deterministic ordered restart-delete automata. Zbl 06983405
Otto, Friedrich
3
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
2
2018
Weighted restarting automata. Zbl 1398.68325
Otto, Friedrich; Wang, Qichao
2
2018
A pumping lemma for ordered restarting automata. Zbl 06767300
Kwee, Kent; Otto, Friedrich
1
2017
On the effects of nondeterminism on ordered restarting automata. Zbl 1442.68095
Kwee, Kent; Otto, Friedrich
8
2016
Weighted restarting automata as language acceptors. Zbl 06650042
Wang, Qichao; Otto, Friedrich
2
2016
On ordered RRWW-automata. Zbl 1436.68179
Kwee, Kent; Otto, Friedrich
1
2016
Some classes of rational functions for pictures. Zbl 1362.68152
Mráz, František; Otto, Friedrich; Průša, Daniel
1
2016
Weighted restarting automata and pushdown relations. Zbl 1454.68063
Wang, Qichao; Otto, Friedrich
1
2016
On some decision problems for stateless deterministic ordered restarting automata. Zbl 1390.68406
Kwee, Kent; Otto, Friedrich
8
2015
Deterministic ordered restarting automata for picture languages. Zbl 1330.68174
Otto, Friedrich; Mráz, František
5
2015
Weighted restarting automata and pushdown relations. Zbl 1465.68167
Wang, Qichao; Hundeshagen, Norbert; Otto, Friedrich
3
2015
Reversible ordered restarting automata. Zbl 1464.68181
Otto, Friedrich; Wendlandt, Matthias; Kwee, Kent
2
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
1
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
10
2014
On the descriptional complexity of deterministic ordered restarting automata. Zbl 1416.68108
Otto, Friedrich
10
2014
Two-dimensional Sgraffito automata. Zbl 1328.68117
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2014
Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265
Otto, Friedrich; Mráz, František
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
Restarting automata for picture languages: a survey on recent developments. Zbl 1302.68174
Otto, Friedrich
2
2014
Systems of parallel communicating restarting automata. Zbl 1366.68153
Vollweiler, Marcel; Otto, Friedrich
1
2014
New results on deterministic sgraffito automata. Zbl 1381.68132
Průša, Daniel; Mráz, František; Otto, Friedrich
3
2013
Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154
Průša, Daniel; Mráz, František; Otto, Friedrich
3
2013
On the descriptional complexity of the window size for deleting restarting automata. Zbl 1309.68121
Kutrib, Martin; Otto, Friedrich
2
2013
Lambda-confluence is undecidable for clearing restarting automata. Zbl 1298.68151
Mráz, František; Otto, Friedrich
1
2013
Globally deterministic CD-systems of stateless R-automata with window size 1. Zbl 1286.68293
Nagy, Benedek; Otto, Friedrich
1
2013
Characterizing the rational functions by restarting transducers. Zbl 1350.68172
Hundeshagen, Norbert; Otto, Friedrich
4
2012
On CD-systems of stateless deterministic R-automata with window size one. Zbl 1279.68167
Nagy, Benedek; Otto, Friedrich
4
2012
Globally deterministic CD-systems of stateless \(R(1)\)-automata. Zbl 1330.68170
Nagy, Benedek; Otto, Friedrich
3
2011
Characterizing the regular languages by nonforgetting restarting automata. Zbl 1221.68133
Hundeshagen, Norbert; Otto, Friedrich
3
2011
Cd-systems of stateless deterministic \(r(1)\)-automata governed by an external pushdown store. Zbl 1250.68172
Nagy, Benedek; Otto, Friedrich
2
2011
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Zbl 1341.68103
Nagy, Benedek; Otto, Friedrich
2
2011
An automata-theoretical characterization of context-free trace languages. Zbl 1298.68152
Nagy, Benedek; Otto, Friedrich
2
2011
A hierarchy of monotone deterministic non-forgetting restarting automata. Zbl 1209.68303
Messerschmidt, Hartmut; Otto, Friedrich
2
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
19
2010
CD-systems of stateless deterministic \(R(1)\)-automata accept all rational trace languages. Zbl 1284.68363
Nagy, Benedek; Otto, Friedrich
8
2010
On stateless deterministic restarting automata. Zbl 1214.68198
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich
7
2010
On lexicalized well-behaved restarting automata that are monotone. Zbl 1250.68173
Otto, Friedrich; Plátek, Martin; Mráz, František
1
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
4
2009
On stateless deterministic restarting automata. Zbl 1206.68116
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich
3
2009
On parallel communicating grammar systems and correctness preserving restarting automata. Zbl 1234.68234
Pardubská, Dana; Plátek, Martin; Otto, Friedrich
1
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.
1
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 the complexity of 2-monotone restarting automata. Zbl 1140.68034
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
3
2008
On determinism versus nondeterminism for restarting automata. Zbl 1328.68114
Messerschmidt, Hartmut; Otto, Friedrich
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
13
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
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.
7
2006
Uniform decision problems for automatic semigroups. Zbl 1106.20042
Kambites, Mark; Otto, Friedrich
5
2006
On nonforgetting restarting automata that are deterministic and/or monotone. Zbl 1185.68394
Messerschmidt, Hartmut; 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
19
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
4
2005
On state-alternating context-free grammars. Zbl 1108.68071
Moriya, Etsuro; Hofbauer, Dieter; Huber, Maria; Otto, Friedrich
4
2005
Hierarchies of weakly monotone restarting automata. Zbl 1101.68587
Mráz, František; Otto, Friedrich
3
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
3
2005
On higher order homological finiteness of rewriting systems. Zbl 1074.20035
Pride, Stephen J.; Otto, Friedrich
2
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
11
2004
For rewriting systems the topological finiteness conditions FDT and FHT are not equivalent. Zbl 1072.20066
Pride, Stephen J.; Otto, Friedrich
7
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
On left-monotone deterministic restarting automata. Zbl 1117.68405
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
13
2003
For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide. Zbl 1028.20041
Kobayashi, Yuji; Otto, Friedrich
9
2003
McNaughton families of languages. Zbl 1044.68082
Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F.
7
2003
Some relatives of automatic and hyperbolic groups. Zbl 1031.20047
Hoffmann, Michael; Kuske, Dietrich; Otto, Friedrich; Thomas, Richard M.
7
2002
Some exact sequences for the homotopy (bi-)module of a monoid. Zbl 1030.20043
Kobayashi, Yuji; Otto, Friedrich
4
2002
On homotopical and homological finiteness conditions for finitely presented monoids. Zbl 1026.20058
Kobayashi, Yuji; Otto, Friedrich
10
2001
Confluent monadic string-rewriting systems and automatic structures. Zbl 0993.68048
Otto, Friedrich; Ruškuc, Nik
5
2001
Restarting automata, Church-Rosser languages, and representations of {r. e. }languages. Zbl 0980.68068
Niemann, Gundula; Otto, Friedrich
10
2000
On Dehn functions of finitely presented bi-automatic monoids. Zbl 0964.68075
Otto, Friedrich
6
2000
Repetitiveness of languages generated by morphisms. Zbl 0947.68086
Kobayashi, Y.; Otto, F.
5
2000
The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems. Zbl 1029.20028
Otto, F.; Sattler-Klein, A.
2
2000
Some applications of prefix-rewriting in monoids, groups, and rings. Zbl 0987.20016
Madlener, Klaus; Otto, Friedrich
1
2000
On s-regular prefix-rewriting systems and automatic structures. Zbl 0944.68086
Otto, Friedrich
6
1999
Modular properties of monoids and string-rewriting systems. Zbl 1047.68074
Otto, Friedrich
4
1999
Growing context-sensitive languages and Church-Rosser languages. Zbl 0894.68093
Buntrock, Gerhard; Otto, Friedrich
38
1998
Automatic monoids versus monoids with finite convergent presentations. Zbl 0914.20052
Otto, Friedrich; Sattler-Klein, Andrea; Madlener, Klaus
14
1998
Some undecidability results concerning the property of preserving regularity. Zbl 0916.68083
Otto, Friedrich
7
1998
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids. Zbl 0920.68064
Otto, Friedrich; Katsura, Masashi; Kobayashi, Yuji
5
1998
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Zbl 0908.68089
Niemann, Gundula; Otto, Friedrich
4
1998
Uniform decision problems for certain restricted classes of finite monoid presentations – a survey on recent undecidability results. Zbl 0969.20030
Otto, Friedrich
1
1998
...and 66 more Documents
all top 5

Cited by 369 Authors

100 Otto, Friedrich
17 Kutrib, Martin
17 Malheiro, António
15 Cain, Alan J.
15 Kobayashi, Yuji
15 Mráz, František
14 Gray, Robert D.
14 Narendran, Paliath
11 Diekert, Volker
11 Lohrey, Markus
9 Madlener, Klaus E.
9 Sénizergues, Géraud
8 Jurdziński, Tomasz
8 Malcher, Andreas
8 Nagy, Benedek
8 Plátek, Martin
8 Thomas, Richard M.
8 Vágvölgyi, Sándor
8 Zhang, Louxin
7 Kambites, Mark
7 Lafont, Yves
7 Messerschmidt, Hartmut
6 Hofbauer, Dieter
6 Malbos, Philippe
6 Pride, Stephen J.
6 Průša, Daniel
6 Ruškuc, Nik
6 Silva, Pedro V.
6 Wendlandt, Matthias
5 Holzer, Markus
5 Waldmann, Johannes
4 Araújo, João
4 Birget, Jean-Camille
4 Book, Ronald Vernon
4 Çevik, Ahmet Sinan
4 Geser, Alfons
4 Guiraud, Yves
4 Hermiller, Susan M.
4 Ibarra, Oscar H.
4 Kapur, Deepak
4 Katsura, Masashi
4 Konieczny, Janusz
4 Krieger, Dalia
4 Kwee, Kent
4 Maltcev, Victor
4 Ol’shanskiĭ, Aleksandr Yur’evich
4 Wang, Qichao
3 Egecioglu, Omer
3 Gilbert, Nick D.
3 Karpuz, Eylem Güzel
3 Klouda, Karel
3 Leupold, Peter
3 Sapir, Mark Valentinovich
3 Wang, Xiaofeng
2 Anselmo, Marcella
2 Ateş, Firat
2 Avenhaus, Jürgen
2 Bauer, Günther
2 Boy de la Tour, Thierry
2 Brittenham, Mark
2 Brown, Ronald
2 Cangul, Ismail Naci
2 Chouraqui, Fabienne
2 Crespi Reghizzi, Stefano
2 Descalço, L.
2 Echahed, Rachid
2 Engelfriet, Joost
2 Gomes, Gracinda M. S.
2 Gould, Victoria A. R.
2 Guba, Victor S.
2 Gyenizse, Pál
2 Heyworth, Anne
2 Hundeshagen, Norbert
2 Ito, Masami
2 Kinyon, Michael K.
2 Kufleitner, Manfred
2 Kuske, Dietrich
2 Laun, Jürn
2 Le Chenadec, Philippe
2 Lucas, Maxime
2 Maden, Ayşe Dilek
2 Madonia, Maria
2 Manuel, Amaldev
2 McDougall, E. A.
2 McNaughton, Robert
2 Meduna, Alexander
2 Métayer, François
2 Mitrana, Victor
2 Moriya, Etsuro
2 Niemann, Gundula
2 Nyberg-Brodda, Carl-Fredrik
2 O’Dunlaing, Colm P.
2 Pardubská, Dana
2 Parkes, Duncan W.
2 Pasku, Elton
2 Piggott, Adam
2 Potapov, Igor
2 Schluter, Natalie
2 Starosta, Štěpán
2 Steinberg, Benjamin
...and 269 more Authors
all top 5

Cited in 75 Serials

96 Theoretical Computer Science
28 International Journal of Algebra and Computation
26 Journal of Algebra
26 Information and Computation
22 International Journal of Foundations of Computer Science
18 Journal of Symbolic Computation
15 Semigroup Forum
13 Journal of Pure and Applied Algebra
12 Acta Informatica
11 Information Processing Letters
9 Communications in Algebra
7 Theory of Computing Systems
7 RAIRO. Theoretical Informatics and Applications
6 Mathematical Systems Theory
6 Transactions of the American Mathematical Society
6 RAIRO. Theoretical Informatics and Applications
5 Journal of Computer and System Sciences
4 Discrete Mathematics
4 International Journal of Computer Mathematics
4 Applicable Algebra in Engineering, Communication and Computing
4 Fundamenta Informaticae
3 Discrete Applied Mathematics
3 MSCS. Mathematical Structures in Computer Science
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 Monatshefte für Mathematik
2 Journal of Automated Reasoning
2 Machine Learning
2 RAIRO. Informatique Théorique et Applications
2 Formal Methods in System Design
2 Journal of Automata, Languages and Combinatorics
2 The Journal of Logic and Algebraic Programming
2 Journal of Algebra and its Applications
2 Bulletin of Mathematical Sciences
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 Applied Mathematics and Computation
1 Compositio Mathematica
1 Geometriae Dedicata
1 Inventiones Mathematicae
1 Journal of Combinatorial Theory. Series A
1 Kybernetika
1 Mathematische Zeitschrift
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 Soft Computing
1 Journal of Group Theory
1 Algebras and Representation Theory
1 Algebraic & Geometric Topology
1 Journal of the Australian Mathematical Society
1 Comptes Rendus. Mathématique. Académie des Sciences, Paris
1 Natural Computing
1 Journal of Discrete Algorithms
1 Journal of Applied Logic
1 Fixed Point Theory and Applications
1 Groups, Complexity, Cryptology
1 Cryptography and Communications
1 ISRN Combinatorics
1 Electronic Journal of Graph Theory and Applications
1 Journal of Combinatorial Algebra
1 British Journal for the History of Mathematics

Citations by Year