Frank Drewes- all publications - |
|
|
Andrea Corradini, Frank Drewes: Term Graph Rewriting and Parallel Term Rewriting. In Proc. 6th Intl. Workshop on Computing with Terms and Graphs (TERMGRAPH 2011), Electronic Proceedings in Theoretical Computer Science. 2011. To appear.
Suna Bensch, Henrik Björklund, Frank Drewes: Algorithmic Properties of Millstream Systems. In Y. Gao, H. Lu, S. Seki, S. Yu, Proc. 14th Intl. Conf. on Developments in Language Theory (DLT 2010), volume 6224 of Lecture Notes in Computer Science, pages 54-65. Springer, 2010.
Suna Bensch, Frank Drewes: Millstream Systems - a Formal Model for Linking Language Modules by Interfaces. In F. Drewes, M. Kuhlmann, Proc. ACL 2010 Workshop on Applications of Tree Automata in Natural Language Processing (ATANLP 2010). The Association for Computer Linguistics, 2010.
Martin Berglund, Frank Drewes: On the Complexity of Variants of the k Best Strings Problem. In J. Holub, Zd'árek, Proc. Prague Stringology Conference 2010 (PSC 2010), pages 76-88. 2010.
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas: Adaptive Star Grammars and Their Languages. Theoretical Computer Science, 2010. To appear.
Frank Drewes: Towards the Tree Automata Workbench Marbles. Electronic Communications of the EASST 16:16 pages, 2010.
Suna Bensch, Frank Drewes: Millstream Systems. Report UMINF 09.21, Umeå University, 2009.
(download file)
Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump (ed.): Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. 2009.
(download file [313 bytes])
Frank Drewes, Johanna Högberg, Andreas Maletti: MAT Learners for Tree Series - an Abstract Data Type and Two Realizations. Report UMINF 09.22, Umeå University, 2009.
(download file [331470 bytes])
Frank Drewes: MAT Learners for Recognizable Tree Languages and Tree Series. Acta Cybernetica 19:249-274, 2009.
Frank Drewes: Towards the Tree Automata Workbench Marbles. In Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump, Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, pages 83-98. 2009.
Frank Drewes, Niels Eetvelde, Berthold Hoffmann, Dirk Janssens, Mark Minas: Shaped Generic Graph Transformation. In A. Schürr, M. Nagl, A. Zündorf, Proc. 3rd Intl. Symp. Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007), volume 5088 of Lecture Notes in Computer Science, pages 201-216. Springer, 2008.
Frank Drewes, Sigrid Ewert, Brink van der Merwe, Christine du Toit, Andries van der Walt: Bag Context Tree Grammars. Fundamenta Informaticae 86:459-480, 2008.
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas: Adaptive Star Grammars and Their Languages. Technical Report 2008-01, Departement Wiskunde-Informatica, Universiteit Antwerpen, 2008.
(download file [367720 bytes])
Frank Drewes, Berthold Hoffmann, Mark Minas: Adaptive Star Grammars for Graph Models. In R. Heckel, G. Taentzer, Proc. 4th International Conference on Graph Transformation (ICGT 2008), volume 5214 of Lecture Notes in Computer Science, pages 442-457. Springer, 2008.
Frank Drewes, Brink van der Merwe: Path Languages of rpc Tree Grammars are Regular. Fundamenta Informaticae 82:47-60, 2008.
Frank Drewes, Niels Eetvelde, Berthold Hoffmann, Dirk Janssens, Mark Minas: Shaped Generic Graph Transformation. In A. Schürr, M. Nagl, A. Zündorf, Preproceedings 3rd Intl. Symp. Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007), pages 197-212. 2007.
Frank Drewes, Johanna Högberg: Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory of Computing Systems 40:163-185, 2007.
Frank Drewes, Johanna Högberg: An Algebra for Tree-Based Music Generation. In S. Bozapalidis, G. Rahonis, Proc. 2nd International Conference on Algebraic Informatics (CAI 2007), volume 4728 of Lecture Notes in Computer Science, pages 172-188. 2007.
Frank Drewes, Carolina von Totth: Constraint-Based Design Grammars. Unpublished manuscript, 2007.
Frank Drewes, Heiko Vogler: Learning Deterministically Recognizable Tree Series. Journal of Automata, Languages and Combinatorics 12:333-354, 2007.
Frank Drewes: Links. International Journal of Foundations of Computer Science 18:1187-1196, 2007.
Frank Drewes: Delegation Networks. Report UMINF 07.04, Umeå University, 2007.
(download file [1457683 bytes])
Frank Drewes: From Tree-Based Generation to Delegation Networks. In S. Bozapalidis, G. Rahonis, Proc. 2nd International Conference on Algebraic Informatics (CAI 2007), volume 4728 of Lecture Notes in Computer Science, pages 48-72. 2007.
Frank Drewes, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Christine du Toit, Andries van der Walt: Bag Context Tree Grammars. Report UMINF 06.03, Umeå University, 2006.
(download file [164296 bytes])
Frank Drewes, Sigrid Ewert, Brink van der Merwe, Christine du Toit, Andries van der Walt: Bag Context Tree Grammars. In Z. Dang, O.H. Ibarra, Proc. 10th Intl. Conf. on Developments in Language Theory (DLT 2006), volume 4036 of Lecture Notes in Computer Science, pages 226-237. 2006.
(download file)
Frank Drewes, Johanna Högberg: Extensions of a MAT Learner for Regular Tree Languages. In M.J. Minock, P. Eklund, H. Lindgren, Proc. 23rd Annual Workshop of the Swedish Artificial Intelligence Society (SAIS 2006), pages 35-44. 2006.
(download file)
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde: Adaptive Star Grammars. In Corradini, Ehrig, Montanari, Ribeiro, Rozenberg, Proc. 3rd International Conference on Graph Transformation (ICGT 2006), volume 4178 of Lecture Notes in Computer Science, pages 77-91. Springer, 2006.
Frank Drewes, Heiko Vogler: Learning Deterministically Recognizable Tree Series. Report UMINF 06.27, Umeå University, 2006. To appear in JALC.
Frank Drewes: Grammatical Picture Generation - A Tree-Based Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer. 2006.
(more info)
Frank Drewes, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Christine du Toit, Andries van der Walt: Random Context Tree Grammars and Tree Transducers. Report UMINF 05.02, Umeå University, 2005.
(download file [187104 bytes])
Frank Drewes, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Christine du Toit, Andries P.J. van der Walt: Random Context Tree Grammars and Tree Transducers. South African Computer Journal 34:11-25, 2005.
Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas: Rule-Based Programming with Diaplan. In T. Mens, A. Schürr, G. Taentzer, Proceedings of the Workshop on Graph Based Tools, volume 127 of Electronic Notes in Theoretical Computer Science, pages 15-26. 2005.
Frank Drewes, Brink van der Merwe: Path Languages of rpc Tree Grammars are Regular. Report UMINF 05.23, Umeå University, 2005.
Frank Drewes, Joost Engelfriet: Branching Synchronization Grammars with Nested Tables. Journal of Computer and System Sciences 68:611-656, 2004.
Frank Drewes, Joost Engelfriet: Branching Grammars: A Generalization of ET0L Systems. In Z. Ésik, Z. Fülöp, Proc. Developments in Language Theory 2003, volume 2710 of Lecture Notes in Computer Science, pages 266-278. Springer, 2003.
(download file [78635 bytes])
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Computing Raster Images from Grid Picture Grammars. Journal of Automata, Languages and Combinatorics 8:499-519, 2003. Short version in Proc. CIAA 2000.
Frank Drewes, Johanna Högberg: Learning a Regular Tree Language from a Teacher. In Z. Ésik, Z. Fülöp, Proc. Developments in Language Theory 2003, volume 2710 of Lecture Notes in Computer Science, pages 279-291. Springer, 2003.
(download file [73599 bytes])
Frank Drewes, Johanna Högberg: Learning a Regular Tree Language from a Teacher even more Efficiently. Report UMINF 03.11, Umeå University, 2003.
(download file [104871 bytes])
Frank Drewes, Berthold Hoffmann, Mark Minas: Context-Exploiting Shapes for Diagram Transformation. Machine GRAPHICS & VISION 12:117-132, 2003.
(download file [69439 bytes])
Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-Driven and Context-Sensitive Collage Languages. Journal of Automata, Languages and Combinatorics 8:5-24, 2003.
Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire: Criteria to Disprove Context-Freeness of Collage Languages. Theoretical Computer Science:1445-1458, 2003.
Frank Drewes, Joost Engelfriet: Branching Synchronization Grammars with Nested Tables. Report UMINF 02.22, Umeå University, 2002.
(download file [198522 bytes])
Frank Drewes, Berthold Hoffmann, Mark Minas: Constructing Shapely Nested Graph Transformations. In H.-J. Kreowski, Proc. Workshop on Applied Graph Transformation, pages 107-118. 2002.
(download file [85217 bytes])
Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. Journal of Computer and System Sciences 64:249-283, 2002. Short version in Proc. FOSSACS 2000, LNCS 1784.
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Computing Raster Images from Grid Picture Grammars. In S. Yu, A. Paun, Proc. 5th Intl. Conference on Implementation and Application of Automata (CIAA 2000), volume 2088 of Lecture Notes in Computer Science, pages 113-121. 2001.
(download file [73626 bytes])
Frank Drewes, Renate Klempien-Hinrichs: TREEBAG. In S. Yu, A. Paun, Proc. 5th Intl. Conference on Implementation and Application of Automata (CIAA 2000), volume 2088 of Lecture Notes in Computer Science, pages 329-330. 2001.
Frank Drewes, Hans-Jörg Kreowski: Reading Words in Graphs Generated by Hyperedge Replacement. In C. Martin-Vide, V. Mitrana, Where Mathematics, Computer Science, Linguistics and Biology meet, pages 243-252. Kluwer Academic Publishers, 2001.
Frank Drewes: Tree-Based Generation of Languages of Fractals. Theoretical Computer Science 262:377-414, 2001.
Frank Drewes: The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. Information and Computation 169:264-283, 2001.
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Computing Raster Images from Grid Picture Grammars. Report 2/00, Univ. Bremen, 2000. Short version appeared in Proc. CIAA 2000.
(download file [267963 bytes])
Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. In Jerzy Tiuryn, Proc. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2000), volume 1784 of Lecture Notes in Computer Science, pages 98-113. 2000.
(download file [101792 bytes])
Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. Report 1/00, Univ. Bremen, 2000. Short version in Proc. FOSSACS 2000, LNCS 1784.
(download file [171250 bytes])
Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-Driven and Context-Sensitive Collage Languages. In G. Rozenberg, W. Thomas, Proc. Developments in Language Theory (DLT'99), pages 326-337. World Scientific, 2000.
(download file [116336 bytes])
Frank Drewes, Renate Klempien-Hinrichs: Picking Knots from Trees. The Syntactic Structure of Celtic Knotwork. Report 4/00, Univ. Bremen, 2000. Short version in Proc. Diagrams 2000, LNAI 1889.
(download file [1480502 bytes])
Frank Drewes, Renate Klempien-Hinrichs: Picking Knots from Trees. The Syntactic Structure of Celtic Knotwork. In M. Anderson, P. Cheng, V. Haarslev, Proc. Diagrams 2000, volume 1889 of Lecture Notes in Artificial Intelligence, pages 89-104. 2000.
(download file [839485 bytes])
Frank Drewes, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske: Graph Transformation Modules and their Composition. In M. Nagl, A. Schürr, Proc. Applications of Graph Transformation with Industrial Relevance (AGTIVE'99), volume 1779 of Lecture Notes in Computer Science, pages 15-30. 2000.
(download file [80407 bytes])
Frank Drewes, Peter Knirsch: TREEBAG - A Short Presentation. In M. Nagl, A. Schürr, Proc. Applications of Graph Transformation with Industrial Relevance (AGTIVE'99), volume 1779 of Lecture Notes in Computer Science, pages 411-417. 2000.
(download file [3230346 bytes])
Frank Drewes: Tree-Based Picture Generation. Theoretical Computer Science 246:1-51, 2000.
Frank Drewes: Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. In H. Ehrig, G. Engels, H.-J. Kreowski, G. Rozenberg, Proc. Sixth Intl. Workshop on Theory and Application of Graph Transformations (TAGT'98), volume 1764 of Lecture Notes in Computer Science, pages 1-14. 2000.
(download file)
Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-Driven and Context-Sensitive Collage Languages (extended abstract). In W. Thomas, Prelim. Proc. Developments in Language Theory (DLT'99), pages 153-163. 1999. Aachener Informatik-Berichte 99-5.
Frank Drewes, Hans-Jörg Kreowski: Picture generation by collage grammars. In H. Ehrig, G. Engels, H.-J. Kreowski, G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 11, pages 397-457. World Scientific, 1999.
Frank Drewes: The Complexity of the Exponential Output Size Problem for Top-Down Tree Transducers. In G. Ciobanu, Gh. Paun, Proc. Fundamentals of Computation Theory (FCT'99), volume 1684 of Lecture Notes in Computer Science, pages 234-245. 1999. Revised version appeared in Information and Computation.
(download file [82417 bytes])
Frank Drewes: Tree-Based Generation of Languages of Fractals. Report 2/99, Univ. Bremen, 1999. Revised version appeared in Theoretical Computer Science.
(download file [4753445 bytes])
Frank Drewes: The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. Report 4/99, Univ. Bremen, 1999. Revised version appeared in Information and Computation.
(download file [116041 bytes])
Frank Drewes, Joost Engelfriet: Decidability of the Finiteness of Ranges of Tree Transductions. Information and Computation 145:1-50, 1998.
Frank Drewes: A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. Theory of Computing Systems 32:159-208, 1998.
Frank Drewes: Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. In G. Engels, G. Rozenberg, Preliminary Proc. Sixth Intl. Workshop on Theory and Application of Graph Transformations (TAGT '98), pages 425-432. 1998. Technical Report tr-ri-98-201, University of Paderborn; revised version appeared in LNCS.
Frank Drewes: TREEBAG - a Tree-Based Generator for Objects of Various
Types. Report 1/98, Univ. Bremen, 1998.
(download file [302787 bytes])
Frank Drewes: Tree-Based Picture Generation. Report 7/98, Univ. Bremen, 1998. Revised version appeared in Theoretical Computer Science 246:1-51.
Frank Drewes: Treebag - Baum-basierte Generierung und Transformation von Objekten. In J. Dassow, R. Kruse, Proc. Informatik '98, Informatik Aktuell, pages 47-56. 1998. In German.
Andrea Corradini, Frank Drewes: (Cyclic) Term Graph Rewriting is Adequate for Rational Parallel Term Rewriting. Technical report TR-97-14, Dipartimento di Informatica, Pisa, 1997.
Frank Drewes, Annegret Habel, Hans-Jörg Kreowski: Hyperedge Replacement Graph Grammars. In G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations, chapter 2, pages 95-162. World Scientific, 1997.
Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire: Criteria to Disprove Context-Freeness of Collage Languages. In B.S. Chlebus, L. Czaja, Proc. Fundamentals of Computation Theory XI, volume 1279 of Lecture Notes in Computer Science, pages 169-178. 1997.
(download file)
Frank Drewes: A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. Report 3/97, Univ. Bremen, 1997. Revised version appeared in Theory of Computing Systems.
Frank Drewes: On the Generation of Trees by Hyperedge Replacement. In I. Prìvara, P. Ruzicka, Proc. Mathematical Foundations of Computer Science 1997, volume 1295 of Lecture Notes in Computer Science, pages 229-238. 1997. Long version appeared in Theory of Computing Systems.
(download file)
Frank Drewes, Joost Engelfriet: Decidability of the Finiteness of Ranges of Tree Transductions. Report 9/96, Univ. Bremen, 1996. Revised version appeared in Information and Computation.
Frank Drewes, Hans-Jörg Kreowski, Nils Schwabe: COLLAGE-ONE: A System for Evaluation and Visualisation of Collage Grammars. In Proc. 4th International Conference on Computer Graphics & Image Processing GKPO'96, volume 5 of Machine Graphics & Vision, pages 393-402. Polish Academy of Sciences, Warsaw, Poland, 1996.
(download file [973469 bytes])
Frank Drewes, Hans-Jörg Kreowski: (Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars. Fundamenta Informaticae 25:295-325, 1996.
Frank Drewes, Uwe Pirr: Abstrakte Objekte dreidimensional und interaktiv. Report 3/96, Univ. Bremen, 1996.
Frank Drewes: A lower bound on the growth of functions computed by tree transducers. Fundamenta Informaticae 26:267-286, 1996. Short version in LNCS 787 (CAAP 94).
Frank Drewes: Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. Journal of Computer and System Sciences 53:33-60, 1996.
Frank Drewes: On the Connectedness of Pictures Defined by Iterated Function Systems. In J. Dassow, G. Rozenberg, A. Salomaa, Proc. 2nd Intl. Conference on Developments in Language Theory-At the Crossroads of Mathematics, Computer Science and Biology, pages 289-298. World Scientific, Singapore, 1996.
Frank Drewes: The Use of Tree Transducers to Compute Translations Between Graph Algebras. In J. Cuny, H. Ehrig, G. Engels, G. Rozenberg, Proc. Fifth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., volume 1073 of Lecture Notes in Computer Science, pages 196-210. Springer, 1996.
(download file)
Frank Drewes: Computation by Tree Transductions. Doctoral dissertation, University of Bremen, Germany, 1996.
(download file [2422613 bytes])
Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating self-affine fractals by collage grammars. Theoretical Computer Science 145:159-187, 1995.
Frank Drewes: Semirings and Tree-to-Graph-to-Tree Transductions. In A. Corradini, U. Montanari, Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA '95), volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1995.
Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating self-affine fractals by collage grammars. In G. Rozenberg, A. Salomaa, Proc. Developments in Language Theory 93. At the Crossroads of Mathematics, Computer Science and Biology, pages 278-289. World Scientific, 1994. Long version appeared in Theoretical Computer Science.
Frank Drewes: A lower bound on the growth of functions computed by tree transductions. In S. Tison, Proc. CAAP 94, volume 787 of Lecture Notes in Computer Science, pages 100-114. Springer, 1994. Revised version in Fundamenta Informaticae 26.
(download file)
Frank Drewes: The Use of Tree Transducers to Compute Translations Between Graph Algebras. Report 8/94, Univ. Bremen, 1994.
Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski: Hyperedge replacement with Rendezvous. In J.P. Jouannaud, 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.
(download file [490151 bytes])
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.
Frank Drewes, Hans-Jörg Kreowski, S. Kuske: Hyperedge Replacement: A Basis for Efficient Graph Algorithms. In M. Beyer, H. Ehrig, M. Löwe, Computing by Graph Transformation (COMPUGRAPH) - Survey, Results, and Applications. 1992. Project brochure.
Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski: Some Modifications of Auxiliary Pushdown Automata. RAIRO Theoretical Informatics and Applications 25:545-556, 1991.
Frank Drewes, H.-J. Kreowski: A Note on Hyperedge Replacement. In H. Ehrig, H.-J. Kreowski, G. Rozenberg, Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., volume 532 of Lecture Notes in Computer Science, pages 1-11. Springer, 1991.
Frank Drewes, Clemens Lautemann: Incremental termination proofs and the length of derivations. In Proc. RTA-91, volume 488 of Lecture Notes in Computer Science, pages 49-61. Springer, 1991.
Frank Drewes: Recognising k-connected hypergraphs in cubic time. Report 3/91, Univ. Bremen, 1991.
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.