University of Bremen Logo  
 
Research Group Theoretical Computer Science
 
Mail to webmaster
Publications in 1993 (get BIBTeX file):

Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski: Hyperedge replacement with Rendezvous. In J.P. Jouannaud, editor, Proc. CAAP'93, volume 668 of Lecture Notes in Computer Science, pages 167-181. Springer, 1993.

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: A sketch of collage grammars. Bulletin of the EATCS 50, 1993.

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating self-affine fractals by collage grammars. Report 3/93, Univ. Bremen, 1993. Revised version appeared in Theoretical Computer Science.

Frank Drewes: A lower bound on the growth of functions computed by tree transducers. Report 4/93, Univ. Bremen, 1993.

Frank Drewes: An optimal term rewrite implementation of queues. Report 5/93, Univ. Bremen, 1993.

Frank Drewes: NP-completeness of k-connected hyperedge-replacement languages of order k. Information Processing Letters 45:89-94, 1993.

Frank Drewes: Recognising k-connected hypergraphs in cubic time. Theoretical Computer Science 109:83-122, 1993.

Frank Drewes: Transducibility-symbolic computation by tree-transductions. Report 2/93, Univ. Bremen, 1993.

Sabine Kuske: Maximum Path Length Pumping Lemma for Edge Replacement Languages. In Zoltán Ésik, editor, Proc. Fundamentals of Computation Theory, volume 710 of Lecture Notes in Computer Science, pages 342-351. 1993.

Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann: A Comparison of Compatible, Finite and Inductive Graph Properties. Theoretical Computer Science 110:145-168, 1993.

Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Collages and Patterns Generated by Hyperedge Replacement. Languages of Design 1:125-145, 1993.

: Canonical Derivations for High-level Replacement Systems. In Hartmut Ehrig, Hans-Jörg Kreowski, Gabriele Taentzer, editors, Tagungsband des Dagstuhl-Seminars über Graph-Transformationen (Jan. 1993), volume 776 of Lecture Notes in Computer Science, pages 153-169. Springer, 1993.

Hans-Jörg Kreowski: Five Facets of Hyperedge Replacement beyond Context-Freeness. In Zoltan Ésik, editor, Proc. Fundamentals of Computation Theory, volume 710 of Lecture Notes in Computer Science, pages 69-86. Springer, 1993.

Hans-Jörg Kreowski: Translations into the Graph Grammar Machine. In Roman M. Sleep, Rinus Plasmeijer, Marko van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 13, pages 171-183. John Wiley, 1993.

Hans-Jörg Kreowski: Some Initial Sections of the Algebraic Specification Tale. In Grzegorz Rozenberg, Arto Salomaa, editors, Current Trends in Theoretical Computer Science - Essays and Tutorials, pages 54-75. World Scientific Press, 1993.

Berthold Hoffmann, Bernd Krieg-Brückner (ed.): Program Development by Specification and Transformation, The PROSPECTRA Methodology, Language Family, and System, volume 680. Lecture Notes in Computer Science. Springer, 1993.

Mail to webmaster