University of Bremen Logo  
 
Research Group Theoretical Computer Science
 
HOME
TEAM
TEACHING
RESEARCH
Publications in 1990 (get BIBTeX file):

Frank Drewes, C. Lautemann: Incremental termination proofs and the length of derivations. Report 7/90, Univ. Bremen, 1990.

Frank Drewes: Parsing ordered graphs generated by hyperedge replacement. Report 10/90, Univ. Bremen, 1990.

Frank Drewes: Unique decompositions of hypergraphs. Report 14/90, Univ. Bremen, 1990.

Hans-Jörg Kreowski, Grzegorz Rozenberg: On Structured Graph Grammars - Part I. Information Sciences 52:185-210, 1990.

Hans-Jörg Kreowski, Grzegorz Rozenberg: On Structured Graph Grammars - Part II. Information Sciences 52:211-246, 1990.

Annegret Habel, Hans-Jörg Kreowski: Filtering Hyperedge-Replacement Languages Through Compatible Properties. In Manfred Nagl, editor, Proc. Workshop on Graphtheoretical Concepts in Computer Science WG'89, volume 411 of Lecture Notes in Computer Science, pages 107-120. Springer, 1990.

Hans-Jörg Kreowski, Zhenyu Quian: Relation-Sorted Specifications with Built-in Coercers: Basic Notions and Results. In Proc. Symposium on Theoretical Aspects of Computer Science STACS'90, volume 415 of Lecture Notes in Computer Science, pages 165-175. Springer, 1990.


Mail Address
University of Bremen
Dept. for Math. &
Computer Science

P.O. Box 330 440
28334 Bremen
Germany

Physical Address
Bibliothekstrasse 5
MZH 5130
28359 Bremen

Phone
++49(421)218 64451

Email (Secr.)
Helga Reinermann

helga@tzi.de