| 2008 |
|---|
| 52 | EE | Frank Drewes,
Berthold Hoffmann,
Mark Minas:
Adaptive Star Grammars for Graph Models.
ICGT 2008: 442-457 |
| 51 | EE | Frank Drewes,
Brink van der Merwe:
Path Languages of Random Permitting Context Tree Grammars are Regular.
Fundam. Inform. 82(1-2): 47-60 (2008) |
| 50 | EE | 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) |
| 2007 |
|---|
| 49 | EE | Frank Drewes,
Berthold Hoffmann,
Dirk Janssens,
Mark Minas,
Niels Van Eetvelde:
Shaped Generic Graph Transformation.
AGTIVE 2007: 201-216 |
| 48 | EE | Frank Drewes,
Johanna Högberg:
An Algebra for Tree-Based Music Generation.
CAI 2007: 172-188 |
| 47 | EE | Frank Drewes:
From Tree-Based Generators to Delegation Networks.
CAI 2007: 48-72 |
| 46 | EE | Frank Drewes:
Links.
Int. J. Found. Comput. Sci. 18(6): 1187-1196 (2007) |
| 45 | | Frank Drewes,
Heiko Vogler:
Learning Deterministically Recognizable Tree Series.
Journal of Automata, Languages and Combinatorics 12(3): 332-354 (2007) |
| 44 | EE | Frank Drewes,
Johanna Högberg:
Query Learning of Regular Tree Languages: How to Avoid Dead States.
Theory Comput. Syst. 40(2): 163-185 (2007) |
| 2006 |
|---|
| 43 | EE | 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 |
| 42 | EE | Frank Drewes,
Berthold Hoffmann,
Dirk Janssens,
Mark Minas,
Niels Van Eetvelde:
Adaptive Star Grammars.
ICGT 2006: 77-91 |
| 2005 |
|---|
| 41 | | 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 |
|---|
| 40 | EE | Frank Drewes,
Joost Engelfriet:
Branching synchronization grammars with nested tables.
J. Comput. Syst. Sci. 68(3): 611-656 (2004) |
| 2003 |
|---|
| 39 | EE | Frank Drewes,
Joost Engelfriet:
Branching Grammars: A Generalization of ET0L Systems.
Developments in Language Theory 2003: 266-278 |
| 38 | EE | Frank Drewes,
Johanna Högberg:
Learning a Regular Tree Language from a Teacher.
Developments in Language Theory 2003: 279-291 |
| 37 | | 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) |
| 36 | | 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) |
| 35 | | Frank Drewes,
Hans-Jörg Kreowski,
Denis Lapoire:
Criteria to disprove context freeness of collage languages.
Theor. Comput. Sci. 290(3): 1445-1458 (2003) |
| 2002 |
|---|
| 34 | EE | Frank Drewes,
Berthold Hoffmann,
Detlef Plump:
Hierarchical Graph Transformation.
J. Comput. Syst. Sci. 64(2): 249-283 (2002) |
| 2001 |
|---|
| 33 | | 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) |
| 32 | EE | Frank Drewes:
Tree-based generation of languages of fractals.
Theor. Comput. Sci. 262(1): 377-414 (2001) |
| 2000 |
|---|
| 31 | EE | Frank Drewes,
Sigrid Ewert,
Renate Klempien-Hinrichs,
Hans-Jörg Kreowski:
Computing Raster Images from Grid Picture Grammars.
CIAA 2000: 113-121 |
| 30 | EE | Frank Drewes,
Renate Klempien-Hinrichs:
TREEBAG.
CIAA 2000: 329-330 |
| 29 | EE | Frank Drewes,
Renate Klempien-Hinrichs:
Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork.
Diagrams 2000: 89-104 |
| 28 | EE | Frank Drewes,
Berthold Hoffmann,
Detlef Plump:
Hierarchical Graph Transformation.
FoSSaCS 2000: 98-113 |
| 27 | EE | Frank Drewes:
Tree-based picture generation.
Theor. Comput. Sci. 246(1-2): 1-51 (2000) |
| 1999 |
|---|
| 26 | EE | Frank Drewes,
Peter Knirsch,
Hans-Jörg Kreowski,
Sabine Kuske:
Graph Transformation Modules and Their Composition.
AGTIVE 1999: 15-30 |
| 25 | EE | Frank Drewes,
Peter Knirsch:
TREEBAG - a Short Presentation.
AGTIVE 1999: 411-417 |
| 24 | | Frank Drewes,
Renate Klempien-Hinrichs,
Hans-Jörg Kreowski:
Table-driven and context-sensitive collage languages.
Developments in Language Theory 1999: 326-337 |
| 23 | EE | Frank Drewes:
Exponential Output Size of Top-Down Tree Transducers.
FCT 1999: 234-245 |
| 22 | EE | Frank Drewes:
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars.
Theory Comput. Syst. 32(2): 159-208 (1999) |
| 1998 |
|---|
| 21 | | Frank Drewes:
TREEBAG - Baum-basierte Generierung und Transformation von Objekten.
GI Jahrestagung 1998: 47-56 |
| 20 | | Frank Drewes:
Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars.
TAGT 1998: 1-14 |
| 19 | | Frank Drewes,
Joost Engelfriet:
Decidability of the Finiteness of Ranges of Tree Transductions.
Inf. Comput. 145(1): 1-50 (1998) |
| 1997 |
|---|
| 18 | | Frank Drewes,
Hans-Jörg Kreowski,
Denis Lapoire:
Criteria to Disprove Context-Freeness of Collage Languages.
FCT 1997: 169-178 |
| 17 | | Frank Drewes,
Hans-Jörg Kreowski,
Annegret Habel:
Hyperedge Replacement, Graph Grammars.
Handbook of Graph Grammars 1997: 95-162 |
| 16 | | Frank Drewes:
On the Generation of Trees by Hyperedge Replacement.
MFCS 1997: 229-238 |
| 1996 |
|---|
| 15 | | Frank Drewes,
Hans-Jörg Kreowski:
(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars.
Fundam. Inform. 25(3): 295-325 (1996) |
| 14 | | Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transducers.
Fundam. Inform. 26(3/4): 267-285 (1996) |
| 13 | | 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 |
|---|
| 12 | | Frank Drewes:
On the Connectedness of Pictures Defined by Iterated Function Systems.
Developments in Language Theory 1995: 289-298 |
| 11 | EE | Frank Drewes:
Semirings and tree-to-graph-to-tree transductions.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 10 | EE | 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) |
| 1994 |
|---|
| 9 | | Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transductions.
CAAP 1994: 100-114 |
| 8 | | Frank Drewes:
The Use of Tree Transducers to Compute Translations Between Graph Algebras.
TAGT 1994: 196-210 |
| 1993 |
|---|
| 7 | | Frank Drewes,
Annegret Habel,
Hans-Jörg Kreowski,
Stefan Taubenberger:
Generating Self-Affine Fractals by Collage Grammars.
Developments in Language Theory 1993: 278-289 |
| 6 | | Gnanamalar David,
Frank Drewes,
Hans-Jörg Kreowski:
Hyperedge Replacement with Rendevous.
TAPSOFT 1993: 167-181 |
| 5 | | Frank Drewes,
Annegret Habel,
Hans-Jörg Kreowski,
S. Traubenberger:
A scetch of Collage Grammars.
Bulletin of the EATCS 50: 209-219 (1993) |
| 4 | | Frank Drewes:
NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k.
Inf. Process. Lett. 45(2): 89-94 (1993) |
| 3 | | Frank Drewes:
Recognising k-Connected Hypergraphs in Cubic Time.
Theor. Comput. Sci. 109(1&2): 83-122 (1993) |
| 1991 |
|---|
| 2 | | Frank Drewes,
Clemens Lautemann:
Incremental Termination Proofs and the Length of Derivations.
RTA 1991: 49-61 |
| 1990 |
|---|
| 1 | | Frank Drewes,
Hans-Jörg Kreowski:
A Note on Hyperedge Replacement.
Graph-Grammars and Their Application to Computer Science 1990: 1-12 |
