Otto, Friedrich.
Otto, Friedrich 1952-
Friedrich Otto
Otto, Friedrich, 1952-20..
VIAF ID: 232679148 ( Personal )
Permalink: http://viaf.org/viaf/232679148
Preferred Forms
- 100 0 _ ‡a Friedrich Otto
- 100 1 0 ‡a Otto, Friedrich
-
-
-
-
- 100 1 _ ‡a Otto, Friedrich ‡d 1952-
- 100 1 _ ‡a Otto, Friedrich ‡d 1952-
- 100 1 _ ‡a Otto, Friedrich, ‡d 1952-20..
-
4xx's: Alternate Name Forms (8)
5xx's: Related Names (8)
- 551 _ _ ‡a Bielefeld
- 510 2 _ ‡a Göttingen, Med. F
- 551 _ _ ‡a Kaiserslautern
- 510 2 _ ‡a Universität Kaiserslautern ‡b Fachbereich Informatik ‡e Affiliation
- 510 2 _ ‡a Universität Kassel ‡b Fachbereich Elektrotechnik, Informatik ‡e Affiliation
- 510 2 _ ‡a Universität Kaiserslautern Fachbereich Informatik
- 510 2 _ ‡a Universität Kaiserslautern ‡b Fachbereich Informatik
- 510 2 _ ‡a Universität Kassel ‡b Fachbereich Elektrotechnik, Informatik
Works
Title | Sources |
---|---|
Characterizations of overlaps in free partially commutative monoids | |
Church-Rosser languages are the deterministic variants of the growing context sensitive languages | |
Codes modulo finite, monadic and confluent thue systems | |
Commutativity in groups presented by finite Church Rosser Thue systems | |
A completion procedure for finitely presented groups that is based on word cycles | |
Decidable sentences for context free groups | |
Derivation-bounded groups | |
Der deutsche Bürgerstand und die deutsche Bürgerschule : eine culturhistorische Erörterung | |
Diss. Fachbereich Informatik. - Kaiserslautern | |
Encoding complexities in decision problems of finitely presented combinatorial systems | |
Equational unification, word unification, and 2nd-order equational unification | |
Erste Ernte : Gedichte | |
Etini-Einbettung in eine einfache Untergruppe einer endlich dargestellten Gruppe | |
For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide | |
For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3 | |
FP∞ is undecidable for finitely presented monoids with word problems decidable in polynomial time | |
Gesammeltes und Eigenes aus dem Tagebuche eines alten Schulmannes | |
Die Gesammtliteratur Niederlands, oder Leben und Wirken der holländischen Schriftsteller seit dem dreizehnten Jahrhundert bis auf unsere Zeit | |
The history of Russian literature, with a lexicon of Russian authors | |
Kontext-freie Sprachen und Transduktionen über abzählbar-unendlichen Alphabeten | |
Language and automata theory and applications : second international conference, LATA 2008, Tarragona, Spain, March 13-19, 2008 : revised papers | |
language of final stack contents of a pushdown automaton is effectively regular | |
LATA 2008 | |
Lehrbuch der russischen Literatur | |
On deciding whether a monoid is a free monoid or is a group | |
On finitely generated non-finite presentations of groups and monoids | |
On properties of monoids that are modular for free products and for certain free products with amalgamated submonoids | |
On the power of RRWW automata | |
On the problem of generating small convergent systems | |
On the quality of pseudo-natural algorithms for the word problem | |
On two problems related to cancellativity | |
Phil. Ludw. Stat. Müller's Anleitung zur holländischen Sprache | |
Regular languages over countably infinite alphabets | |
remark on derivations in certain HNN extensions | |
Repetitiveness of languages generated by morphisms | |
Restarting automata and their relations to the Chomsky hierarchy | |
Restarting automata notes for a course at the 3rd International PhD School in Formal Languages and Applications | |
Rewriting methods for monoid semirings | |
Sequential monotonicity for restarting automata | |
Shrinking alternating two-pushdown automata | |
Solute transport in porous media with equilibrium and non-equilibrium multiple-site adsorption uniqueness of weak solutions | |
Some remarks on finitely presented monoids with automatic structure | |
Some undecidability results for finitely generated Thue congruences on a two-letter alphabet | |
Some undecidability results for non-monadic Church-Rosser Thue systems | |
String rewriting systems | |
Ueber die Behandlung des öffentl. Unterrichts | |
undecidability of self embedding for finite semi thue and thue systems | |
Uniform decision problems for certain restricted classes of finite monoid presentations a survey on recent undecidability results | |
Untersuchungen zur Komplexität algorithmischer Probleme in abzählbar erzeugten Gruppen | |
Using string rewriting for solving the world problem for finitely presented groups | |
When is an extension of a specification consistent? Decidable and undecidable cases | |
Wie der kleine Schüler sich seine Fibel selbst schreibt : eine Sprech-, Schreib- und Lesefibel |