|
СТ |
On the Connections between Rewriting and Formal Language Theory |
1999 |
Otto F. |
|
|
|
Lecture Notes in Computer Science |
15.07.1999 |
|
СТ |
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages |
1998 |
Niemann G., Otto F. |
|
|
|
Lecture Notes in Computer Science |
18.04.1998 |
|
СТ |
Some Independence Results for Equational Unification |
1995 |
Otto F., Narendran P., Dougherty D. J. |
|
|
|
Lecture Notes in Computer Science |
28.04.1995 |
|
П |
Kontext-freie Sprachen und Transduktionen uber abzahlbar-unendlichen Alphabeten |
1982 |
Otto F. |
|
|
Univ. Kaiserslautern |
|
19.11.1991 |
|
П |
Pseudo-natural algorithms for decision problems in certain types of string-rewriting systems |
1984 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
19.11.1991 |
|
П |
On deciding whether a monoid is a free monoid or is a group |
1985 |
Otto F. |
|
|
Univ. Kaiserslautern |
|
22.10.1991 |
|
П |
Commutativity in groups presented by finite Church-Rosser Thue systems |
1986 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
22.10.1991 |
|
П |
On two problems related to cancellativity |
1985 |
Otto F. |
|
|
Univ. Kaiserslautern |
|
22.10.1991 |
|
П |
It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |
1987 |
Narendran P., Otto F. |
|
|
Univ. Kaiserslautern |
|
19.10.1991 |
|
П |
On the quality of pseudo-natural algorithms for the word problem |
1983 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
25.09.1991 |
|
П |
Some undecidability results for non-monadic Church-Rosser Thue systems |
1984 |
Otto F. |
|
|
Univ. Kaiserslautern |
|
25.09.1991 |
|
П |
On finitely generated non-finite presentations of groups and monoids |
1983 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
25.09.1991 |
|
П |
Groups presented by finite two-monadic Church-Rosser Thue systems |
1984 |
Avenhaus J., Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
21.09.1991 |
|
П |
Derivation-Bounded Groups |
1981 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
20.09.1991 |
|
П |
Finite complete rewriting systems and the complexity of the word problem |
1984 |
Bauer G., Otto F. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
СТ |
A specialized completion procedure for monadic string-rewriting systems presenting groups |
1991 |
Madlener K., Narendran P., Otto F. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
|
П |
Eine E-Frattini-Einbettung in eine einfache Untergruppe einer endlich dargestellten Gruppe |
1980 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
15.05.1991 |
|
П |
Desidable Sentences for Context-Free Groups |
1990 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
29.03.1991 |
|
П |
A Test For Lambda-Confluence For Certain Prefix Rewriting Systems With Applications To The Generalized Word Problem |
1990 |
Kuhn N., Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
29.03.1991 |
