Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Otto, Friedrich"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lambda-confluence for context rewriting systems
Friedrich Otto
,
Frantis̑ek Mráz
Theoretical Computer Science
578
, 2015, pp. 88-99
On the descriptional complexity of the window size for deleting restarting automata
Martin Kutrib
,
Friedrich Otto
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 831-846
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
Benedek Nagy
,
Friedrich Otto
Acta Informatica
50
(4), 2013, pp. 229-255
On centralized parallel communicating grammar systems with context-sensitive components
Friedrich Otto
International Journal of Foundations of Computer Science
24
(4), 2013, pp. 453-471
On CD-systems of stateless deterministic R-automata with window size one
Benedek Nagy
,
Friedrich Otto
Journal of Computer and System Sciences
78
(3), 2012, pp. 780-806
On stateless deterministic restarting automata
Martin Kutrib
,
Hartmut Messerschmidt
,
Friedrich Otto
Acta Informatica
47
(7-8), 2011, pp. 391-412
A hierarchy of monotone deterministic non-forgetting restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
Theory of Computing Systems
48
(2), 2011, pp. 343-373
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
Dana Pardubská
,
Martin Plátek
,
Friedrich Otto
Theoretical Computer Science
412
(4-5), 2011, pp. 458-477
On stateless two-pushdown automata and restarting automata
Martin Kutrib
,
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
21
(5), 2010, pp. 781-798
On alternating phrase-structure grammars
Etsuro Moriya
,
Friedrich Otto
International Journal of Foundations of Computer Science
21
(1), 2010, pp. 1-25
On deterministic CD-systems of restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 185-209
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Martin Plátek
,
Friedrich Otto
,
Frantis̑ek Mráz
Information and Computation
207
(11), 2009, pp. 1300-1314
On the complexity of 2-monotone restarting automata
Tomasz Jurdziński
,
Friedrich Otto
,
Frantis̑ek Mráz
,
Martin Plátek
Theory of Computing Systems
42
(4), 2008, pp. 488-518
On determinism versus nondeterminism for restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
Information and Computation
206
(9-10), 2008, pp. 1204-1218
Shrinking restarting automata
Tomasz Jurdziński
,
Friedrich Otto
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 361-385
Cooperating distributed systems of restarting automata
Hartmut Messerschmidt
,
Friedrich Otto
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1333-1342
Restarting automata with restricted utilization of auxiliary symbols
Tomasz Jurdziński
,
Friedrich Otto
Theoretical Computer Science
363
(2), 2006, pp. 162-181
Shrinking restarting automata
Tomasz Jurdziński
,
Friedrich Otto
Lecture Notes in Computer Science
3618
, 2005, pp. 532-543
On state-alternating context-free grammars
Etsuro Moriya
,
Dieter Hofbauer
,
Maria Huber
,
Friedrich Otto
Theoretical Computer Science
337
(1-3), 2005, pp. 183-216
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
Gundula Niemann
,
Friedrich Otto
Information and Computation
197
(1-2), 2005, pp. 1-21
Reduction relations for monoid semirings
Friedrich Otto
,
Olga Sokratova
Journal Symbolic Computation
37
(3), 2004, pp. 343-376
Reduction relations for monoid semirings
Friedrich Otto
,
Olga Sokratova
Journal Symbolic Computation
37
(3), 2004, pp. 343-376
Undecidable properties of monoids with word problem solvable in linear time. Part II - Cross sections and homological and homotopical finiteness conditions
Masashi Katsura
,
Yuji Kobayashi
,
Friedrich Otto
Theoretical Computer Science
301
(1-3), 2003, pp. 79-101
Undecidability results for monoids with linear-time decidable word problems
Masashi Katsura
,
Yuji Kobayashi
,
Friedrich Otto
Lecture Notes in Computer Science
1969
, 2000, pp. 278-289
On
S
-regular prefix-rewriting systems and automatic structures
Friedrich Otto
Lecture Notes in Computer Science
1627
, 1999, pp. 422-431
Seiten 1
2
3
>