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
[2]
Hilfe
Suche: Author="Benson, David B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Separating the complexity classes
\cal NL
and
\cal NP
David B. Benson
misc, 2000, Apr
Fixed points in free process algebras, Part II
Jerzy Tiuryn
,
David B. Benson
Theoretical Computer Science
70
, 1990, pp. 179-192
Fixed points in free process algebras, Part I
David B. Benson
,
Jerzy Tiuryn
Theoretical Computer Science
63
, 1989, pp. 275-294
Bisimulation of automata
David B. Benson
,
Ofer Ben-Shachar
Information and Computation
79
(1), 1988, pp. 60-83
In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
David B. Benson
Math. Systems Theory
15
, 1982, pp. 267-275
The basic algebraic structures in categories of derivations
David B. Benson
Information and Control
28
, 1975, pp. 1-29
An abstract machine theory for formal language parsers
David B. Benson
Acta Informatica
3
, 1974, pp. 187-202
Semantic preserving translations
David B. Benson
Math. Systems Theory
8
, 1974/75, pp. 105-126
Syntax and semantics: A categorical view
David B. Benson
Information and Control
17
, 1970, pp. 145-160