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: Journal=Theor.~Comput.~Sci. AND Volume=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On some natural complete operators
K. Ko
Theoretical Computer Science
37
(1), 1985, pp. 1-30
On coordinated selective substitutions: Towards a unified theory of grammars and machines
G. Rozenberg
Theoretical Computer Science
37
(1), 1985, pp. 31-50
The theory of ends, pushdown automata, and second-order logic
D.E. Muller
,
P.E. Schupp
Theoretical Computer Science
37
(1), 1985, pp. 51-75
Algebra of communicating processes with abstraction
J.A. Bergstra
,
J.W. Klop
Theoretical Computer Science
37
(1), 1985, pp. 77-121
Reductions in tree replacement systems
J.H. Gallier
,
R.V. Book
Theoretical Computer Science
37
(2), 1985, pp. 123-150
A contribution to the theory of program testing
L. Bougé
Theoretical Computer Science
37
(2), 1985, pp. 151-181
Topological transformations as a tool in the design of systolic networks
K. Culik II
,
I. Fris
Theoretical Computer Science
37
(2), 1985, pp. 183-216
Applications of scheduling theory to formal language theory
J. Gonczarowski
,
M.K. Warmuth
Theoretical Computer Science
37
(2), 1985, pp. 217-243
Higher-level synchronizing devices in MEIJE-SCCS
R. de Simone
Theoretical Computer Science
37
(3), 1985, pp. 245-267
On the existence of free models in abstract algebraic institutions
A. Tarlecki
Theoretical Computer Science
37
(3), 1985, pp. 269-304
About fair asynchrony
Ph. Darondeau
Theoretical Computer Science
37
(3), 1985, pp. 305-336
Adding global forbidding context to context-free grammars
A. Ehrenfeucht
,
H.C.M. Kleijn
,
G. Rozenberg
Theoretical Computer Science
37
(3), 1985, pp. 337-360