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
Hilfe
Suche: Author="Petersen, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved bounds for functions related to busy beavers
A.M. Ben-Amram
,
H. Petersen
Theory of Computing Systems
35
(1), 2002, pp. 1-11
On the language of primitive words
H. Petersen
Theoretical Computer Science
161
(1-2), 1996, pp. 141-156
On space functions fully constructed by two-dimensional Turing machines
H. Petersen
Information Processing Letters
54
, 1995, pp. 9-10
Some results concerning two-dimensional Turing machines and finite automata
H. Petersen
Lecture Notes in Computer Science
965
, 1995, pp. 374-382
Alternation in simple devices
H. Petersen
Lecture Notes in Computer Science
944
, 1995, pp. 315-323
A remark on a paper by A.B. Matos
H. Petersen
Theoretical Computer Science
141
(1-2), 1995, pp. 329-330
Cancellation in context-free languages: Enrichment by reduction
M. Jantzen
,
H. Petersen
Theoretical Computer Science
127
(1), 1994, pp. 149-170
Notes on looping deterministic two-way pushdown automata
M. Ladermann
,
H. Petersen
Information Processing Letters
49
, 1994, pp. 123-127
Refined simulation of multihead automata
H. Petersen
Information Processing Letters
52
, 1994, pp. 229-233
On the determinacy problem for two-way pushdown automata
H. Petersen
Information Processing Letters
52
, 1994, pp. 323-324
The ambiguity of primitive words
H. Petersen
Lecture Notes in Computer Science
775
, 1994, pp. 679-690
Cancellation in context-free languages: Enrichment by reduction
M. Jantzen
,
H. Petersen
Lecture Notes in Computer Science
665
, 1993, pp. 206-215