Travelled to:1 × Brazil
1 × Finland
1 × The Netherlands
1 × United Kingdom
2 × Canada
2 × France
2 × Italy
2 × USA
3 × Hungary
6 × Germany
Collaborated with:H.Kreowski B.Hoffmann ∅ M.Minas R.Klempien-Hinrichs P.Knirsch B.v.d.Merwe A.Habel M.Berglund H.Björklund J.Engelfriet J.Högberg C.Lautemann S.Ewert D.Janssens N.V.Eetvelde J.Björklund N.Zechner S.Bensch D.Plump N.G.David S.Kuske S.Taubenberger B.Watson C.d.Toit A.P.J.v.d.Walt
Talks about:grammar (10) graph (6) hyperedg (5) replac (5) tree (5) transform (3) regular (3) system (3) collag (3) algorithm (2)
Person: Frank Drewes
DBLP: Drewes:Frank
Facilitated 1 volumes:
EdContributed to:
2015
2015
2014
2013
20112010200820072006200620032000
20001999199919981997199519941993
19911990
1993Wrote 26 papers:
- ICGT-2015-DrewesHM #parsing #predict #top-down
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars (FD, BH, MM), pp. 19–34.
- LATA-2015-BjorklundDZ #algorithm #automaton #performance
- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.
- AFL-2014-BerglundDM #backtracking #behaviour #regular expression
- Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching (MB, FD, BvdM), pp. 109–123.
- DLT-2013-BerglundBDMW #regular expression
- Cuts in Regular Expressions (MB, HB, FD, BvdM, BW), pp. 70–81.
- AGTIVE-2011-DrewesHM
- Contextual Hyperedge Replacement (FD, BH, MM), pp. 182–197.
- DLT-2010-BenschBD #algorithm
- Algorithmic Properties of Millstream Systems (SB, HB, FD), pp. 54–65.
- ICGT-2008-DrewesHM #adaptation #graph #modelling
- Adaptive Star Grammars for Graph Models (FD, BH, MM), pp. 442–457.
- AGTIVE-2007-DrewesHJME #graph transformation
- Shaped Generic Graph Transformation (FD, BH, DJ, MM, NVE), pp. 201–216.
- DLT-2006-DrewesTEMW
- Bag Context Tree Grammars (FD, CdT, SE, BvdM, APJvdW), pp. 226–237.
- ICGT-2006-DrewesHJME #adaptation
- Adaptive Star Grammars (FD, BH, DJ, MM, NVE), pp. 77–91.
- DLT-2003-DrewesE #branch
- Branching Grammars: A Generalization of ET0L Systems (FD, JE), pp. 266–278.
- DLT-2003-DrewesH #education #learning
- Learning a Regular Tree Language from a Teacher (FD, JH), pp. 279–291.
- CIAA-2000-DrewesEKK #grid #image
- Computing Raster Images from Grid Picture Grammars (FD, SE, RKH, HJK), pp. 113–121.
- CIAA-2000-DrewesK
- TREEBAG (FD, RKH), pp. 329–330.
- FoSSaCS-2000-DrewesHP #graph transformation
- Hierarchical Graph Transformation (FD, BH, DP), pp. 98–113.
- AGTIVE-1999-DrewesK #named
- TREEBAG — a Short Presentation (FD, PK), pp. 411–417.
- AGTIVE-1999-DrewesKKK #composition #graph transformation
- Graph Transformation Modules and Their Composition (FD, PK, HJK, SK), pp. 15–30.
- DLT-1999-DrewesKK
- Table-driven and context-sensitive collage languages (FD, RKH, HJK), pp. 326–337.
- TAGT-1998-Drewes #generative #power of
- Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars (FD), pp. 1–14.
- GG-Handbook-Vol1-DrewesKH #graph grammar
- Hyperedge Replacement, Graph Grammars (FD, HJK, AH), pp. 95–162.
- DLT-1995-Drewes #on the
- On the Connectedness of Pictures Defined by Iterated Function Systems (FD), pp. 289–298.
- TAGT-1994-Drewes #algebra #graph #transducer #using
- The Use of Tree Transducers to Compute Translations Between Graph Algebras (FD), pp. 196–210.
- DLT-1993-DrewesHKT #generative #self
- Generating Self-Affine Fractals by Collage Grammars (FD, AH, HJK, ST), pp. 278–289.
- RTA-1991-DrewesL #incremental #proving #termination
- Incremental Termination Proofs and the Length of Derivations (FD, CL), pp. 49–61.
- GG-1990-DrewesK
- A Note on Hyperedge Replacement (FD, HJK), pp. 1–12.
- TAPSOFT-1993-DavidDK
- Hyperedge Replacement with Rendevous (NGD, FD, HJK), pp. 167–181.