Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Frank Drewes
2010 – today
- 2013
[c37]Frank Drewes: Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). DCFS 2013: 14-16- [c36]Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce Watson: Cuts in Regular Expressions. Developments in Language Theory 2013: 70-81
- [e1]Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto (Eds.): Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. books@ocg.at 294, Österreichische Computer Gesellschaft 2013, ISBN 978-3-85403-294-6
- 2011
- [j30]Frank Drewes, Johanna Högberg, Andreas Maletti: MAT learners for tree series: an abstract data type and two realizations. Acta Inf. 48(3): 165-189 (2011)
- [c35]
- [c34]Frank Drewes: Selected Decision Problems for Square-Refinement Collage Grammars. Algebraic Foundations in Computer Science 2011: 1-29
- [c33]Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe: Incremental Construction of Millstream Configurations Using Graph Transformation. FSMNLP 2011: 93-97
- [c32]Andrea Corradini, Frank Drewes: Term Graph Rewriting and Parallel Term Rewriting. TERMGRAPH 2011: 3-18
- 2010
- [j29]
- [j28]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. ECEASST 26 (2010)
- [j27]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas: Adaptive star grammars and their languages. Theor. Comput. Sci. 411(34-36): 3090-3109 (2010)
- [c31]Suna Bensch, Henrik Björklund, Frank Drewes: Algorithmic Properties of Millstream Systems. Developments in Language Theory 2010: 54-65
- [c30]Martin Berglund, Frank Drewes: On the Complexity of Variants of the k Best Strings Problem. Stringology 2010: 76-88
2000 – 2009
- 2009
- [j26]Frank Drewes: MAT Learners for Recognizable Tree Languages and Tree Series. Acta Cybern. 19(2): 249-274 (2009)
- 2008
- [j25]Frank Drewes, Brink van der Merwe: Path Languages of Random Permitting Context Tree Grammars are Regular. Fundam. Inform. 82(1-2): 47-60 (2008)
- [j24]Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt: Bag Context Tree Grammars. Fundam. Inform. 86(4): 459-480 (2008)
- [c29]Frank Drewes, Berthold Hoffmann, Mark Minas: Adaptive Star Grammars for Graph Models. ICGT 2008: 442-457
- 2007
- [j23]
- [j22]Frank Drewes, Heiko Vogler: Learning Deterministically Recognizable Tree Series. Journal of Automata, Languages and Combinatorics 12(3): 332-354 (2007)
- [j21]Frank Drewes, Johanna Högberg: Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. 40(2): 163-185 (2007)
- [c28]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde: Shaped Generic Graph Transformation. AGTIVE 2007: 201-216
- [c27]
- [c26]
- 2006
- [c25]Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt: Bag Context Tree Grammars. Developments in Language Theory 2006: 226-237
- [c24]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde: Adaptive Star Grammars. ICGT 2006: 77-91
- 2005
- [j20]Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas: Rule-Based Programming with Diaplan. Electr. Notes Theor. Comput. Sci. 127(1): 15-26 (2005)
- [j19]Frank Drewes, Christine du Toit, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Andries P. J. van der Walt: Random context tree grammars and tree transducers. South African Computer Journal 34: 11-25 (2005)
- 2004
- [j18]Frank Drewes, Joost Engelfriet: Branching synchronization grammars with nested tables. J. Comput. Syst. Sci. 68(3): 611-656 (2004)
- 2003
- [j17]Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-Driven and Context-Sensitive Collage Languages. Journal of Automata, Languages and Combinatorics 8(1): 5-24 (2003)
- [j16]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(3): 499-519 (2003)
- [j15]Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire: Criteria to disprove context freeness of collage languages. Theor. Comput. Sci. 290(3): 1445-1458 (2003)
- [c23]Frank Drewes, Joost Engelfriet: Branching Grammars: A Generalization of ET0L Systems. Developments in Language Theory 2003: 266-278
- [c22]Frank Drewes, Johanna Högberg: Learning a Regular Tree Language from a Teacher. Developments in Language Theory 2003: 279-291
- 2002
- [j14]Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. J. Comput. Syst. Sci. 64(2): 249-283 (2002)
- 2001
- [j13]Frank Drewes: The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. Inf. Comput. 169(2): 264-283 (2001)
- [j12]Frank Drewes: Tree-based generation of languages of fractals. Theor. Comput. Sci. 262(1): 377-414 (2001)
- [c21]Frank Drewes, Hans-Jörg Kreowski: Reading words in graphs generated by hyperedge replacement. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 243-252
- 2000
- [j11]
- [c20]Frank Drewes, Renate Klempien-Hinrichs: Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork. Diagrams 2000: 89-104
- [c19]Frank Drewes, Berthold Hoffmann, Detlef Plump: Hierarchical Graph Transformation. FoSSaCS 2000: 98-113
- [c18]Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Computing Raster Images from Grid Picture Grammars. CIAA 2000: 113-121
- [c17]
1990 – 1999
- 1999
- [j10]Frank Drewes: A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. Theory Comput. Syst. 32(2): 159-208 (1999)
- [c16]Frank Drewes, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske: Graph Transformation Modules and Their Composition. AGTIVE 1999: 15-30
- [c15]
- [c14]Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-driven and context-sensitive collage languages. Developments in Language Theory 1999: 326-337
- [c13]
- 1998
- [j9]Frank Drewes, Joost Engelfriet: Decidability of the Finiteness of Ranges of Tree Transductions. Inf. Comput. 145(1): 1-50 (1998)
- [c12]Frank Drewes: TREEBAG - Baum-basierte Generierung und Transformation von Objekten. GI Jahrestagung 1998: 47-56
- [c11]Frank Drewes: Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. TAGT 1998: 1-14
- 1997
- [c10]Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire: Criteria to Disprove Context-Freeness of Collage Languages. FCT 1997: 169-178
- [c9]Frank Drewes, Hans-Jörg Kreowski, Annegret Habel: Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162
- [c8]
- 1996
- [b1]Frank Drewes: Computation by tree transductions. Universität Bremen 1996, pp. 1-194
- [j8]Frank Drewes, Hans-Jörg Kreowski: (Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars. Fundam. Inform. 25(3): 295-325 (1996)
- [j7]Frank Drewes: A Lower Bound on the Growth of Functions Computed by Tree Transducers. Fundam. Inform. 26(3/4): 267-285 (1996)
- [j6]Frank Drewes: Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. J. Comput. Syst. Sci. 53(1): 33-66 (1996)
- 1995
- [j5]Frank Drewes: Semirings and tree-to-graph-to-tree transductions. Electr. Notes Theor. Comput. Sci. 2: 81-88 (1995)
- [j4]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. 145(1&2): 159-187 (1995)
- [c7]Frank Drewes: On the Connectedness of Pictures Defined by Iterated Function Systems. Developments in Language Theory 1995: 289-298
- 1994
- [c6]Frank Drewes: A Lower Bound on the Growth of Functions Computed by Tree Transductions. CAAP 1994: 100-114
- [c5]Frank Drewes: The Use of Tree Transducers to Compute Translations Between Graph Algebras. TAGT 1994: 196-210
- 1993
- [j3]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: A scetch of Collage Grammars. Bulletin of the EATCS 50: 209-219 (1993)
- [j2]Frank Drewes: NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. Inf. Process. Lett. 45(2): 89-94 (1993)
- [j1]Frank Drewes: Recognising k-Connected Hypergraphs in Cubic Time. Theor. Comput. Sci. 109(1&2): 83-122 (1993)
- [c4]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory 1993: 278-289
- [c3]Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski: Hyperedge Replacement with Rendevous. TAPSOFT 1993: 167-181
- 1991
- [c2]Frank Drewes, Clemens Lautemann: Incremental Termination Proofs and the Length of Derivations. RTA 1991: 49-61
- 1990
- [c1]Frank Drewes, Hans-Jörg Kreowski: A Note on Hyperedge Replacement. Graph-Grammars and Their Application to Computer Science 1990: 1-12
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:02 CEST by the dblp team