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=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Concurrent program schemes and their logics
D. Peleg
Theoretical Computer Science
55
(1), 1987, November, pp. 1-45
Parameter-reduction of higher level grammars
H. Seidl
Theoretical Computer Science
55
(1), 1987, November, pp. 47-85
Sequential and concurrent behaviour in Petri net theory
E. Best
,
R. Devillers
Theoretical Computer Science
55
(1), 1987, November, pp. 87-136
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
B. Courcelle
Theoretical Computer Science
55
(2-3), 1987, December, pp. 141-181
Representations of language families by homomorphic equality operations and generalized equality sets
F.-J. Brandenburg
Theoretical Computer Science
55
(2-3), 1987, December, pp. 183-263
An equational axiomatization of systolic systems
M. Bartha
Theoretical Computer Science
55
(2-3), 1987, December, pp. 265-289
A universal machine without change of state
J.-P. Lehmann
Theoretical Computer Science
55
(2-3), 1987, December, pp. 291-348