default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Drewes
Person information
- affiliation: University of Umeå, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]Gerold Jäger, Frank Drewes:
Optimal strategies for the static black-peg AB game with two and three pegs. Discret. Math. Algorithms Appl. 16(4): 2350049:1-2350049:34 (2024)- [j52]Frank Drewes
, Yannick Stade:
On the power of local graph expansion grammars with and without additional restrictions. Theor. Comput. Sci. 1015: 114763 (2024) - [i6]Frank Drewes, Berthold Hoffmann, Mark Minas:
Finite Automata for Efficient Graph Recognition. CoRR abs/2404.15052 (2024) - 2023
- [j51]Johanna Björklund, Frank Drewes, Anna Jonsson:
Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. Comput. Linguistics 49(4): 841-882 (2023) - [j50]Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid tree automata and the yield theorem for constituent tree automata. Theor. Comput. Sci. 979: 114185 (2023) - [c70]Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes:
ADCluster: Adaptive Deep Clustering for Unsupervised Learning from Unlabeled Documents. ICNLSP 2023: 68-77 - [c69]Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson:
Generating Semantic Graph Corpora with Graph Expansion Grammar. NCMA 2023: 3-15 - [e7]Frank Drewes, Mikhail Volkov:
Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings. Lecture Notes in Computer Science 13911, Springer 2023, ISBN 978-3-031-33263-0 [contents] - 2022
- [j49]Johanna Björklund, Frank Drewes, Anna Jonsson:
Improved N-Best Extraction with an Evaluation on Language Data. Comput. Linguistics 48(1): 119-153 (2022) - [c68]Frank Drewes, Berthold Hoffmann, Mark Minas:
Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. ICGT 2022: 3-19 - [c67]Anton Eklund, Mona Forsman, Frank Drewes:
Dynamic Topic Modeling by Clustering Embeddings from Pretrained Language Models: A Research Proposal. AACL/IJCNLP 2022 (Student Research Workshop) 2022: 84-91 - [c66]Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA 2022: 93-105 - [i5]Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes:
An Algebraic Approach to Learning and Grounding. CoRR abs/2204.02813 (2022) - 2021
- [j48]Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke:
Uniform parsing for hyperedge replacement grammars. J. Comput. Syst. Sci. 118: 1-27 (2021) - [j47]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. 870: 3-28 (2021) - [c65]Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes:
Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling. CIKM 2021: 3078-3082 - [c64]Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes:
Bridging Perception, Memory, and Inference through Semantic Relations. EMNLP (1) 2021: 9136-9142 - [c63]Frank Drewes, Berthold Hoffmann, Mark Minas:
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars. ICGT 2021: 164-184 - [i4]Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund, Frank Drewes:
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. CoRR abs/2102.11115 (2021) - [i3]Johanna Björklund, Frank Drewes, Anna Jonsson:
Polynomial Graph Parsing with Non-Structural Reentrancies. CoRR abs/2105.02033 (2021) - 2020
- [j46]Gerold Jäger, Frank Drewes:
The metric dimension of Zn×Zn×Zn is ⌊3n/2⌋. Theor. Comput. Sci. 806: 344-362 (2020) - [c62]Adam Dahlgren Lindström, Johanna Björklund, Suna Bensch, Frank Drewes:
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. COLING 2020: 730-744 - [c61]Frank Drewes, Berthold Hoffmann, Mark Minas:
Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers. ICGT 2020: 221-238
2010 – 2019
- 2019
- [j45]Johannes Blum, Frank Drewes:
Language theoretic properties of regular DAG languages. Inf. Comput. 265: 57-76 (2019) - [j44]Johanna Björklund, Frank Drewes, Niklas Zechner:
Efficient enumeration of weighted tree languages over the tropical semiring. J. Comput. Syst. Sci. 104: 119-130 (2019) - [j43]Frank Drewes, Makoto Kanazawa:
Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue. J. Lang. Model. 7(2): 1-2 (2019) - [j42]Frank Drewes, Berthold Hoffmann, Mark Minas:
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Log. Algebraic Methods Program. 104: 303-341 (2019) - [c60]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP 2019: 7-17 - [c59]Frank Drewes:
A Survey of Recent Advances in Efficient Parsing for Graph Grammars. FSMNLP 2019 - [c58]Frank Drewes, Berthold Hoffmann, Mark Minas:
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars. ICGT 2019: 55-72 - [c57]Johanna Björklund, Frank Drewes, Giorgio Satta:
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA 2019: 83-94 - 2018
- [j41]David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta:
Weighted DAG Automata for Semantic Graphs. Comput. Linguistics 44(1) (2018) - [j40]Martin Berglund, Frank Drewes, Brink van der Merwe:
The Output Size Problem for String-to-Tree Transducers. J. Autom. Lang. Comb. 23(1-3): 19-38 (2018) - [c56]Martin Berglund, Frank Drewes, Brink van der Merwe:
On regular expressions with backreferences and transducers. NCMA 2018: 49-64 - [c55]Gerold Jäger, Frank Drewes:
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT 2018: 261-266 - [c54]Johanna Björklund, Frank Drewes, Anna Jonsson:
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. CIAA 2018: 97-108 - [i2]Frank Drewes, Berthold Hoffmann, Mark Minas:
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement. CoRR abs/1812.11927 (2018) - 2017
- [j39]Frank Drewes:
On DAG Languages and DAG Transducers. Bull. EATCS 121 (2017) - [j38]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae 155(1-2): 89-110 (2017) - [j37]Frank Drewes:
Preface. Theor. Comput. Sci. 679: 1 (2017) - [j36]Johanna Björklund, Frank Drewes, Anna Jonsson:
Finding the N best vertices in an infinite weighted hypergraph. Theor. Comput. Sci. 682: 30-41 (2017) - [c53]Frank Drewes, Berthold Hoffmann, Mark Minas:
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars. ICGT 2017: 106-122 - [c52]Frank Drewes:
DAG Automata for Meaning Representation. MOL 2017: 88-99 - [c51]Martin Berglund, Henrik Björklund, Frank Drewes:
Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. TAG 2017: 94-101 - [c50]Frank Drewes, Anna Jonsson:
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. TAG 2017: 102-111 - [e6]Frank Drewes:
Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing, FSMNLP 2017, Umeå, Sweden, September 2017. Association for Computational Linguistics 2017 [contents] - [e5]Frank Drewes, Carlos Martín-Vide, Bianca Truthe:
Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science 10168, 2017, ISBN 978-3-319-53732-0 [contents] - 2016
- [c49]Johannes Blum, Frank Drewes:
Properties of Regular DAG Languages. LATA 2016: 427-438 - [c48]Henrik Björklund, Frank Drewes, Petter Ericson:
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. LATA 2016: 521-532 - [c47]Frank Drewes, Berthold Hoffmann, Mark Minas:
Approximating Parikh Images for Generating Deterministic Graph Parsers. STAF Workshops 2016: 112-128 - 2015
- [j35]Frank Drewes, Berthold Hoffmann:
Contextual hyperedge replacement. Acta Informatica 52(6): 497-524 (2015) - [j34]Frank Drewes, Joost Engelfriet:
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. Acta Cybern. 22(2): 373-392 (2015) - [j33]Frank Drewes, Jérôme Leroux:
Structurally Cyclic Petri Nets. Log. Methods Comput. Sci. 11(4) (2015) - [j32]Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto:
Preface. Fundam. Informaticae 136(1-2) (2015) - [j31]Frank Drewes, Joost Engelfriet:
The generative power of delegation networks. Inf. Comput. 245: 213-258 (2015) - [c46]Frank Drewes, Berthold Hoffmann, Mark Minas:
Predictive Top-Down Parsing for Hyperedge Replacement Grammars. ICGT 2015: 19-34 - [c45]Patrick Aichroth, Christian Weigel, Thomas Kurz, Horst Stadler, Frank Drewes, Johanna Björklund, Kai Schlegel, Emanuel Berndl, Antonio Perez, Alex Bowyer, Andrea Volpini:
MICO - Media in Context. ICME Workshops 2015: 1-4 - [c44]Johanna Björklund, Frank Drewes, Niklas Zechner:
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. LATA 2015: 97-108 - [c43]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU 2015: 45-60 - [c42]Suna Bensch, Frank Drewes, Thomas Hellström:
Grammatical inference of graph transformation rules. NCMA 2015: 73-90 - [e4]Frank Drewes:
Implementation and Application of Automata - 20th International Conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings. Lecture Notes in Computer Science 9223, Springer 2015, ISBN 978-3-319-22359-9 [contents] - [i1]Frank Drewes, Kevin Knight, Marco Kuhlmann:
Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). Dagstuhl Reports 5(3): 143-161 (2015) - 2014
- [j30]Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe:
Graph transformation for incremental natural language analysis. Theor. Comput. Sci. 531: 1-25 (2014) - [c41]Martin Berglund, Frank Drewes, Brink van der Merwe:
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. AFL 2014: 109-123 - 2013
- [c40]Frank Drewes:
Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). DCFS 2013: 14-16 - [c39]Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson:
Cuts in Regular Expressions. Developments in Language Theory 2013: 70-81 - [c38]Martin Berglund, Henrik Björklund, Frank Drewes:
On the Parameterized Complexity of Linear Context-Free Rewriting Systems. MOL 2013: 21-29 - [e3]Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto:
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 [contents] - 2012
- [e2]Frank Drewes, Marco Kuhlmann:
Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, ATANLP 2012, Avignon, France, April 24, 2012. The Association for Computer Linguistics 2012, ISBN 978-1-937284-19-0 [contents] - 2011
- [j29]Frank Drewes, Johanna Högberg, Andreas Maletti:
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48(3): 165-189 (2011) - [c37]Frank Drewes, Berthold Hoffmann, Mark Minas:
Contextual Hyperedge Replacement. AGTIVE 2011: 182-197 - [c36]Frank Drewes:
Selected Decision Problems for Square-Refinement Collage Grammars. Algebraic Foundations in Computer Science 2011: 1-29 - [c35]Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe:
Incremental Construction of Millstream Configurations Using Graph Transformation. FSMNLP 2011: 93-97 - [c34]Andrea Corradini, Frank Drewes:
Term Graph Rewriting and Parallel Term Rewriting. TERMGRAPH 2011: 3-18 - 2010
- [j28]Frank Drewes:
Towards the Tree Automata Workbench Marbles. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j27]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. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j26]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas:
Adaptive star grammars and their languages. Theor. Comput. Sci. 411(34-36): 3090-3109 (2010) - [c33]Suna Bensch, Frank Drewes:
Millstream Systems - a Formal Model for Linking Language Modules by Interfaces. ATANLP@ACL 2010 2010: 28-36 - [c32]Suna Bensch, Henrik Björklund, Frank Drewes:
Algorithmic Properties of Millstream Systems. Developments in Language Theory 2010: 54-65 - [c31]Martin Berglund, Frank Drewes:
On the Complexity of Variants of the k Best Strings Problem. Stringology 2010: 76-88 - [e1]Frank Drewes, Marco Kuhlmann:
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, ATANLP@ACL 2010, Uppsala, Sweden, July 16, 2010. Association for Computational Linguistics 2010, ISBN 978-1-932432-79-4 [contents]
2000 – 2009
- 2009
- [j25]Frank Drewes:
MAT Learners for Recognizable Tree Languages and Tree Series. Acta Cybern. 19(2): 249-274 (2009) - 2008
- [j24]Frank Drewes, Brink van der Merwe:
Path Languages of Random Permitting Context Tree Grammars are Regular. Fundam. Informaticae 82(1-2): 47-60 (2008) - [j23]Frank Drewes, Christine du Toit, Sigrid Ewert, Brink van der Merwe, Andries P. J. van der Walt:
Bag Context Tree Grammars. Fundam. Informaticae 86(4): 459-480 (2008) - [c30]Frank Drewes, Berthold Hoffmann, Mark Minas:
Adaptive Star Grammars for Graph Models. ICGT 2008: 442-457 - 2007
- [j22]Frank Drewes:
Links. Int. J. Found. Comput. Sci. 18(6): 1187-1196 (2007) - [j21]Frank Drewes, Heiko Vogler:
Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. 12(3): 332-354 (2007) - [j20]Frank Drewes, Johanna Högberg:
Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. 40(2): 163-185 (2007) - [c29]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde:
Shaped Generic Graph Transformation. AGTIVE 2007: 201-216 - [c28]Frank Drewes:
From Tree-Based Generators to Delegation Networks. CAI 2007: 48-72 - [c27]Frank Drewes, Johanna Högberg:
An Algebra for Tree-Based Music Generation. CAI 2007: 172-188 - 2006
- [b2]Frank Drewes:
Grammatical Picture Generation - A Tree-Based Approach. Texts in Theoretical Computer Science. An EATCS Series, Springer 2006, ISBN 978-3-540-21304-8, pp. 1-476 - [c26]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 - [c25]Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde:
Adaptive Star Grammars. ICGT 2006: 77-91 - 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 Afr. Comput. J. 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) - [c24]Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas:
Rule-Based Programming with Diaplan. GraBaTs 2004: 15-26 - 2003
- [j17]Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Table-Driven and Context-Sensitive Collage Languages. J. Autom. Lang. Comb. 8(1): 5-24 (2003) - [j16]Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Computing Raster Images from Grid Picture Grammars. J. Autom. Lang. Comb. 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]Frank Drewes:
Tree-based picture generation. Theor. Comput. Sci. 246(1-2): 1-51 (2000) - [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]Frank Drewes, Renate Klempien-Hinrichs:
TREEBAG. CIAA 2000: 329-330
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]Frank Drewes, Peter Knirsch:
TREEBAG - a Short Presentation. AGTIVE 1999: 411-417 - [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]Frank Drewes:
Exponential Output Size of Top-Down Tree Transducers. FCT 1999: 234-245 - 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:
On the Generation of Trees by Hyperedge Replacement. MFCS 1997: 229-238 - [p1]Frank Drewes, Hans-Jörg Kreowski, Annegret Habel:
Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162 - 1996
- [b1]Frank Drewes:
Computation by tree transductions. University of Bremen, Germany, 1996, pp. 1-194 - [j8]Frank Drewes, Hans-Jörg Kreowski:
(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars. Fundam. Informaticae 25(3): 295-325 (1996) - [j7]Frank Drewes:
A Lower Bound on the Growth of Functions Computed by Tree Transducers. Fundam. Informaticae 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, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. 145(1&2): 159-187 (1995) - [c8]Frank Drewes:
On the Connectedness of Pictures Defined by Iterated Function Systems. Developments in Language Theory 1995: 289-298 - [c7]Frank Drewes:
Semirings and tree-to-graph-to-tree transductions. SEGRAGRA 1995: 81-88 - 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
- [j4]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
A scetch of Collage Grammars. Bull. EATCS 50: 209-219 (1993) - [j3]Frank Drewes:
NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. Inf. Process. Lett. 45(2): 89-94 (1993) - [j2]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]N. Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski:
Hyperedge Replacement with Rendevous. TAPSOFT 1993: 167-181 - 1991
- [j1]Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski:
Some modifications of auxiliary pushdown automata. RAIRO Theor. Informatics Appl. 25: 545-556 (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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
