WIKINDX

TZI Literaturverzeichnis

List Resources

Displaying 1 - 25 of 64 (Bibliography: WIKINDX Master Bibliography)
 
Parameters:
Creator:  Drewes
G. Buntrock, F. Drewes, C. Lautemann and T. Mossakowski, "Some Modifications of Auxiliary Pushdown Automata", RAIRO Theoretical Informatics and Applications, vol. 25, iss. 6, pp. 545–556, 1991. Added by: Deleted user  v    Pop. 70.09%
A. Corradini and F. Drewes, "(Cyclic) Term Graph Rewriting is Adequate for Rational Parallel Term Rewriting", Dipartimento di Informatica, Pisa, TR-97-14, 1997. Added by: Deleted user  v    Pop. 61.6%
G. David, F. Drewes and H.-J. Kreowski, "Hyperedge replacement with Rendezvous" in Proc. CAAP'93, ser. Lecture Notes in Computer Science, J. P. Jouannaud, Ed., vol. 668, 1993, pp. 167–181. Added by: Deleted user  v    Pop. 85.21%
F. Drewes and C. Lautemann, "Incremental termination proofs and the length of derivations", Universität Bremen, Bremen, Germany, Report 7/90, 1990. Added by: Deleted user  v    Pop. 63.93%
F. Drewes, "Parsing ordered graphs generated by hyperedge replacement", Universität Bremen, Bremen, Germany, Report 10/90, 1990. Added by: Deleted user  v    Pop. 67.04%
F. Drewes, "Unique decompositions of hypergraphs", Universität Bremen, Bremen, Germany, Report 14/90, 1990. Added by: Deleted user  v    Pop. 56.56%
F. Drewes and H.-J. Kreowski, "A Note on Hyperedge Replacement" in Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci. ser. Lecture Notes in Computer Science, H. Ehrig, H.-J. Kreowski and G. Rozenberg, Eds., vol. 532, 1991, pp. 1–11. Added by: Deleted user  v    Pop. 63.33%
F. Drewes and C. Lautemann, "Incremental termination proofs and the length of derivations" in Proc. RTA--91, ser. Lecture Notes in Computer Science, vol. 488, 1991, pp. 49–61. Added by: Deleted user  v    Pop. 50.13%
F. Drewes, "Recognising $k$--connected hypergraphs in cubic time", Universität Bremen, Bremen, Germany, Report 3/91, 1991. Added by: Deleted user  v    Pop. 59.81%
F. Drewes, H.-J. Kreowski and S. Kuske, "Hyperedge Replacement: A Basis for Efficient Graph Algorithms" in Computing by Graph Transformation (COMPUGRAPH) --- Survey, Results, and Applications, M. Beyer, H. Ehrig and M. Löwe, Eds., 1992, Added by: Deleted user  v    Pop. 61.87%
F. Drewes, A. Habel, H.-J. Kreowski and S. Taubenberger, "A sketch of collage grammars", Bulletin of the EATCS, vol. 50, 1993. Added by: Deleted user  v    Pop. 51.92%
F. Drewes, A. Habel, H.-J. Kreowski and S. Taubenberger, "Generating self-affine fractals by collage grammars", Universität Bremen, Bremen, Germany, Report 3/93, 1993. Added by: Deleted user  v    Pop. 57.76%
F. Drewes, "A lower bound on the growth of functions computed by tree transducers", Universität Bremen, Bremen, Germany, Report 4/93, 1993. Added by: Deleted user  v    Pop. 57.89%
F. Drewes, "An optimal term rewrite implementation of queues", Universität Bremen, Bremen, Germany, Report 5/93, 1993. Added by: Deleted user  v    Pop. 46.68%
F. Drewes, "NP-completeness of $k$-connected hyperedge-replacement languages of order $k$", Information Processing Letters, vol. 45, pp. 89–94, 1993. Added by: Deleted user  v    Pop. 43.3%
F. Drewes, "Recognising $k$--connected hypergraphs in cubic time", Theoretical Computer Science, vol. 109, pp. 83–122, 1993. Added by: Deleted user  v    Pop. 42.11%
F. Drewes, "Transducibility---symbolic computation by tree-transductions", Universität Bremen, Bremen, Germany, Report 2/93, 1993. Added by: Deleted user  v    Pop. 31.83%
F. Drewes, A. Habel, H.-J. Kreowski and S. Taubenberger, "Generating self-affine fractals by collage grammars" in Proc. Developments in Language Theory 93. At the Crossroads of Mathematics, Computer Science and Biology, G. Rozenberg and A. Salomaa, Eds., 1994, pp. 278–289. Added by: Deleted user  v    Pop. 51.19%
F. Drewes, "A lower bound on the growth of functions computed by tree transductions" in Proc.\ CAAP'94, ser. Lecture Notes in Computer Science, S. Tison, Ed., vol. 787, 1994, pp. 100–114. Added by: Deleted user  v    Pop. 36.94%
F. Drewes, "The Use of Tree Transducers to Compute Translations Between Graph Algebras", Universität Bremen, Bremen, Germany, Report 8/94, 1994. Added by: Deleted user  v    Pop. 37.47%
F. Drewes, A. Habel, H.-J. Kreowski and S. Taubenberger, "Generating self-affine fractals by collage grammars", Theoretical Computer Science, vol. 145, pp. 159–187, 1995. Added by: Deleted user  v    Pop. 54.64%
F. Drewes, "Semirings and Tree-to-Graph-to-Tree Transductions" in Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA '95), ser. Electronic Notes in Theoretical Computer Science, A. Corradini and U. Montanari, Eds., vol. 2, 1995, Last edited by: Rafael Balcerowski  v    Pop. 38.99%
F. Drewes and J. Engelfriet, "Decidability of the Finiteness of Ranges of Tree Transductions", Universität Bremen, Bremen, Germany, Report 9/96, 1996. Added by: Deleted user  v    Pop. 38.66%
F. Drewes, H.-J. Kreowski and N. Schwabe, "COLLAGE-ONE: A System for Evaluation and Visualisation of Collage Grammars" in Proc. 4th International Conference on Computer Graphics \& Image Processing GKPO'96, ser. Machine Graphics & Vision, vol. 5, Warsaw, Poland, 1996, pp. 393–402. Added by: Deleted user  v    Pop. 58.69%
F. Drewes and H.-J. Kreowski, "(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars", Fundamenta Informaticae, vol. 25, pp. 295–325, 1996. Added by: Deleted user  v    Pop. 57.89%

1 - 25   |   26 - 50   |   51 - 64
wikindx      |     Total Resources:  2954     |     Database queries:  104     |     Script execution:  0.38871 secs