Searching for authors named Friedrich Otto – sorted by Relevance.
29 documents found, showing 1 through 10.
Next 10 →
-
Uniform decision problems for certain restricted classes of finite monoid-presentations - A survey on recent undecidability results
- … on recent undecidability results Friedrich Otto Fachbereich Mathematik/Informatik, Universitat Kassel, D…
- Add To MetaCart
-
A Survey on the Computational Power of Some Classes of Finite Monoid-Presentations
- …A survey on the computational power of some classes of finite monoid-presentations Friedrich Otto…
- Add To MetaCart
-
On S-Regular Prefix-Rewriting Systems and Automatic Structures
- …On s-regular prefix-rewriting systems and automatic structures Friedrich Otto Fachbereich…
- Cited by 4 (2 self) – Add To MetaCart
-
Solvability of Word Equations Modulo Finite Special And Confluent String-Rewriting Systems Is Undecidable In General
- … Is Undecidable In General Friedrich Otto Fachbereich Mathematik/Informatik, Universitat GH Kassel 34109 Kassel…
- Cited by 3 (3 self) – Add To MetaCart
-
On Properties of Monoids That Are Modular for Free Products and for Certain Free Products With Amalgamated Submonoids
- … with amalgamated submonoids Friedrich Otto Fachbereich Mathematik/Informatik Universitat Kassel 34109 Kassel…
- Cited by 2 (2 self) – Add To MetaCart
-
On Dehn functions of finitely presented bi-automatic monoids
- …On Dehn functions of finitely presented bi-automatic monoids Friedrich Otto Fachbereich…
- Cited by 1 (1 self) – Add To MetaCart
-
Some Decision Problems Related To The Regularity Of Monoids
- …Some Decision Problems Related To The Regularity Of Monoids Friedrich Otto Fachbereich Mathematik…
- Cited by 1 (1 self) – Add To MetaCart
-
Lexicalized RRWW-Automata – A New Measure for The Degree of Nondeterminism of (Context-Free) Languages ∗
- …@(email omitted); Friedrich Otto Fachbereich Elektrotechnik/Informatik Universität Kassel, 34109 Kassel, Germany E-mail: otto…
- Add To MetaCart
-
Repetitiveness Of Languages Generated By Morphisms
- …@(email omitted); Friedrich Otto Fachbereich Mathematik/Informatik Universitat Kassel D-34109 Kassel, Germany Internet…
- Add To MetaCart
-
FP_infinity is undecidable for finitely presented monoids with word problems decidable in polynomial time
- … Robert Cremanns and Friedrich Otto Fachbereich Mathematik/Informatik Universitat Kassel, 34109 Kassel…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
