A Note on Hyperedge Replacement. - Frank Drewes; Hans-Jörg Kreowski (Graph-Grammars and Their Application to Computer Science, 1990)

Incremental Termination Proofs and the Length of Derivations. - Frank Drewes; Clemens Lautemann (RTA, 1991)

Some modifications of auxiliary pushdown automata. - Gerhard Buntrock; Frank Drewes; Clemens Lautemann; Till Mossakowski (RAIRO Theor. Informatics Appl., 1991)

Hyperedge Replacement with Rendevous. - N. Gnanamalar David; Frank Drewes; Hans-Jörg Kreowski (TAPSOFT, 1993)

A scetch of Collage Grammars. - Frank Drewes; Annegret Habel; Hans-Jörg Kreowski; Stefan Taubenberger (Bull. EATCS, 1993)

NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. - Frank Drewes (Inf. Process. Lett., 1993)

Recognising k-Connected Hypergraphs in Cubic Time. - Frank Drewes (Theor. Comput. Sci., 1993)

A Lower Bound on the Growth of Functions Computed by Tree Transductions. - Frank Drewes (CAAP, 1994)

The Use of Tree Transducers to Compute Translations Between Graph Algebras. - Frank Drewes (TAGT, 1994)

On the Connectedness of Pictures Defined by Iterated Function Systems. - Frank Drewes (Developments in Language Theory, 1995)

Semirings and tree-to-graph-to-tree transductions. - Frank Drewes (SEGRAGRA, 1995)

Generating Self-Affine Fractals by Collage Grammars. - Frank Drewes; Annegret Habel; Hans-Jörg Kreowski; Stefan Taubenberger (Theor. Comput. Sci., 1995)

Computation by tree transductions. - Frank Drewes (1996)

A Lower Bound on the Growth of Functions Computed by Tree Transducers. - Frank Drewes (Fundam. Informaticae, 1996)

(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars. - Frank Drewes; Hans-Jörg Kreowski (Fundam. Informaticae, 1996)

Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid. - Frank Drewes (J. Comput. Syst. Sci., 1996)

Hyperedge Replacement, Graph Grammars. - Frank Drewes; Hans-Jörg Kreowski; Annegret Habel (Handbook of Graph Grammars, 1997)

On the Generation of Trees by Hyperedge Replacement. - Frank Drewes (MFCS, 1997)

TREEBAG - Baum-basierte Generierung und Transformation von Objekten. - Frank Drewes (GI Jahrestagung, 1998)

Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars. - Frank Drewes (TAGT, 1998)

Decidability of the Finiteness of Ranges of Tree Transductions. - Frank Drewes; Joost Engelfriet (Inf. Comput., 1998)

TREEBAG - a Short Presentation. - Frank Drewes; Peter Knirsch 001 (AGTIVE, 1999)

Graph Transformation Modules and Their Composition. - Frank Drewes; Peter Knirsch 001; Hans-Jörg Kreowski; Sabine Kuske (AGTIVE, 1999)

Exponential Output Size of Top-Down Tree Transducers. - Frank Drewes (FCT, 1999)

A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars. - Frank Drewes (Theory Comput. Syst., 1999)

Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork. - Frank Drewes; Renate Klempien-Hinrichs (Diagrams, 2000)

TREEBAG. - Frank Drewes; Renate Klempien-Hinrichs (CIAA, 2000)

Tree-based picture generation. - Frank Drewes (Theor. Comput. Sci., 2000)

Reading words in graphs generated by hyperedge replacement. - Frank Drewes; Hans-Jörg Kreowski (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers. - Frank Drewes (Inf. Comput., 2001)

Tree-based generation of languages of fractals. - Frank Drewes (Theor. Comput. Sci., 2001)

Hierarchical Graph Transformation. - Frank Drewes; Berthold Hoffmann; Detlef Plump (J. Comput. Syst. Sci., 2002)

Branching Grammars: A Generalization of ET0L Systems. - Frank Drewes; Joost Engelfriet (Developments in Language Theory, 2003)

Learning a Regular Tree Language from a Teacher. - Frank Drewes; Johanna Högberg (Developments in Language Theory, 2003)

Computing Raster Images from Grid Picture Grammars. - Frank Drewes; Sigrid Ewert; Renate Klempien-Hinrichs; Hans-Jörg Kreowski (J. Autom. Lang. Comb., 2003)

Table-Driven and Context-Sensitive Collage Languages. - Frank Drewes; Renate Klempien-Hinrichs; Hans-Jörg Kreowski (J. Autom. Lang. Comb., 2003)

Criteria to disprove context freeness of collage languages. - Frank Drewes; Hans-Jörg Kreowski; Denis Lapoire (Theor. Comput. Sci., 2003)

Rule-Based Programming with Diaplan. - Frank Drewes; Berthold Hoffmann; Raimund Klein; Mark Minas (GraBaTs, 2004)

Branching synchronization grammars with nested tables. - Frank Drewes; Joost Engelfriet (J. Comput. Syst. Sci., 2004)

Random context tree grammars and tree transducers. - Frank Drewes; Christine du Toit; Sigrid Ewert; Johanna Högberg; Brink van der Merwe; Andries P. J. van der Walt (South Afr. Comput. J., 2005)

Adaptive Star Grammars. - Frank Drewes; Berthold Hoffmann; Dirk Janssens; Mark Minas; Niels Van Eetvelde (ICGT, 2006)

Grammatical Picture Generation - A Tree-Based Approach - Frank Drewes (Springer, 2006)

Shaped Generic Graph Transformation. - Frank Drewes; Berthold Hoffmann; Dirk Janssens; Mark Minas; Niels Van Eetvelde (AGTIVE, 2007)

From Tree-Based Generators to Delegation Networks. - Frank Drewes (CAI, 2007)

An Algebra for Tree-Based Music Generation. - Frank Drewes; Johanna Högberg (CAI, 2007)

Links. - Frank Drewes (Int. J. Found. Comput. Sci., 2007)

Learning Deterministically Recognizable Tree Series. - Frank Drewes; Heiko Vogler (J. Autom. Lang. Comb., 2007)

Query Learning of Regular Tree Languages: How to Avoid Dead States. - Frank Drewes; Johanna Högberg (Theory Comput. Syst., 2007)

Adaptive Star Grammars for Graph Models. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2008)

Path Languages of Random Permitting Context Tree Grammars are Regular. - Frank Drewes; Brink van der Merwe (Fundam. Informaticae, 2008)

Bag Context Tree Grammars. - Frank Drewes; Christine du Toit; Sigrid Ewert; Brink van der Merwe; Andries P. J. van der Walt (Fundam. Informaticae, 2008)

MAT Learners for Recognizable Tree Languages and Tree Series. - Frank Drewes (Acta Cybern., 2009)

Millstream Systems - a Formal Model for Linking Language Modules by Interfaces. - Suna Bensch; Frank Drewes (ATANLP@ACL 2010, 2010)

Algorithmic Properties of Millstream Systems. - Suna Bensch; Henrik Björklund; Frank Drewes (Developments in Language Theory, 2010)

On the Complexity of Variants of the k Best Strings Problem. - Martin Berglund; Frank Drewes (Stringology, 2010)

Towards the Tree Automata Workbench Marbles. - Frank Drewes (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. - Frank Drewes; Annegret Habel; Berthold Hoffmann; Detlef Plump (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Adaptive star grammars and their languages. - Frank Drewes; Berthold Hoffmann; Dirk Janssens; Mark Minas (Theor. Comput. Sci., 2010)

Contextual Hyperedge Replacement. - Frank Drewes; Berthold Hoffmann; Mark Minas (AGTIVE, 2011)

Selected Decision Problems for Square-Refinement Collage Grammars. - Frank Drewes (Algebraic Foundations in Computer Science, 2011)

Incremental Construction of Millstream Configurations Using Graph Transformation. - Suna Bensch; Frank Drewes; Helmut Jürgensen; Brink van der Merwe (FSMNLP, 2011)

MAT learners for tree series: an abstract data type and two realizations. - Frank Drewes; Johanna Högberg; Andreas Maletti (Acta Informatica, 2011)

Term Graph Rewriting and Parallel Term Rewriting - Andrea Corradini 001; Frank Drewes (TERMGRAPH, 2011)

Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract). - Frank Drewes (DCFS, 2013)

Cuts in Regular Expressions. - Martin Berglund; Henrik Björklund; Frank Drewes; Brink van der Merwe; Bruce W. Watson (Developments in Language Theory, 2013)

On the Parameterized Complexity of Linear Context-Free Rewriting Systems. - Martin Berglund; Henrik Björklund; Frank Drewes (MOL, 2013)

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching. - Martin Berglund; Frank Drewes; Brink van der Merwe (AFL, 2014)

Graph transformation for incremental natural language analysis. - Suna Bensch; Frank Drewes; Helmut Jürgensen; Brink van der Merwe (Theor. Comput. Sci., 2014)

Predictive Top-Down Parsing for Hyperedge Replacement Grammars. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2015)

MICO - Media in Context. - Patrick Aichroth; Christian Weigel; Thomas Kurz; Horst Stadler; Frank Drewes; Johanna Björklund; Kai Schlegel; Emanuel Berndl; Antonio Perez; Alex Bowyer; Andrea Volpini (ICME Workshops, 2015)

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. - Johanna Björklund; Frank Drewes; Niklas Zechner (LATA, 2015)

Grammatical inference of graph transformation rules. - Suna Bensch; Frank Drewes; Thomas Hellström (NCMA, 2015)

Contextual hyperedge replacement. - Frank Drewes; Berthold Hoffmann (Acta Informatica, 2015)

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars. - Frank Drewes; Joost Engelfriet (Acta Cybern., 2015)

Structurally Cyclic Petri Nets. - Frank Drewes; Jérôme Leroux (Log. Methods Comput. Sci., 2015)

Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). - Frank Drewes; Kevin Knight; Marco Kuhlmann (Dagstuhl Reports, 2015)

Preface. - Suna Bensch; Frank Drewes; Mika Hirvensalo; Friedrich Otto (Fundam. Informaticae, 2015)

The generative power of delegation networks. - Frank Drewes; Joost Engelfriet (Inf. Comput., 2015)

Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. - Henrik Björklund; Frank Drewes; Petter Ericson (LATA, 2016)

Properties of Regular DAG Languages. - Johannes Blum 001; Frank Drewes (LATA, 2016)

Approximating Parikh Images for Generating Deterministic Graph Parsers. - Frank Drewes; Berthold Hoffmann; Mark Minas (STAF Workshops, 2016)

Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2017)

DAG Automata for Meaning Representation. - Frank Drewes (MOL, 2017)

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. - Martin Berglund; Henrik Björklund; Frank Drewes (TAG, 2017)

Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations. - Frank Drewes; Anna Jonsson 001 (TAG, 2017)

On DAG Languages and DAG Transducers. - Frank Drewes (Bull. EATCS, 2017)

Tight Bounds for Cut-Operations on Deterministic Finite Automata. - Frank Drewes; Markus Holzer 001; Sebastian Jakobi; Brink van der Merwe (Fundam. Informaticae, 2017)

Finding the N best vertices in an infinite weighted hypergraph. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Theor. Comput. Sci., 2017)

Preface. - Frank Drewes (Theor. Comput. Sci., 2017)

On regular expressions with backreferences and transducers. - Martin Berglund; Frank Drewes; Brink van der Merwe (NCMA, 2018)

An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. - Gerold Jäger; Frank Drewes (SAGT, 2018)

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (CIAA, 2018)

Weighted DAG Automata for Semantic Graphs. - David Chiang 001; Frank Drewes; Daniel Gildea; Adam Lopez; Giorgio Satta (Comput. Linguistics, 2018)

The Output Size Problem for String-to-Tree Transducers. - Martin Berglund; Frank Drewes; Brink van der Merwe (J. Autom. Lang. Comb., 2018)

A Survey of Recent Advances in Efficient Parsing for Graph Grammars. - Frank Drewes (FSMNLP, 2019)

Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2019)

Z-Automata for Compact and Direct Representation of Unranked Tree Languages. - Johanna Björklund; Frank Drewes; Giorgio Satta (CIAA, 2019)

Language theoretic properties of regular DAG languages. - Johannes Blum 001; Frank Drewes (Inf. Comput., 2019)

Efficient enumeration of weighted tree languages over the tropical semiring. - Johanna Björklund; Frank Drewes; Niklas Zechner (J. Comput. Syst. Sci., 2019)

Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue. - Frank Drewes; Makoto Kanazawa (J. Lang. Model., 2019)

Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. - Frank Drewes; Berthold Hoffmann; Mark Minas (J. Log. Algebraic Methods Program., 2019)

Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. - Adam Dahlgren Lindström; Johanna Björklund; Suna Bensch; Frank Drewes (COLING, 2020)

Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2020)

The metric dimension of Zn×Zn×Zn is ⌊3n/2⌋. - Gerold Jäger; Frank Drewes (Theor. Comput. Sci., 2020)

Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling. - Arezoo Hatefi; Xuan-Son Vu; Monowar H. Bhuyan; Frank Drewes (CIKM, 2021)

Bridging Perception, Memory, and Inference through Semantic Relations. - Johanna Björklund; Adam Dahlgren Lindström; Frank Drewes (EMNLP (1), 2021)

Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2021)

Polynomial Graph Parsing with Non-Structural Reentrancies. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (CoRR, 2021)

Uniform parsing for hyperedge replacement grammars. - Henrik Björklund; Frank Drewes; Petter Ericson; Florian Starke (J. Comput. Syst. Sci., 2021)

Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. - Johanna Björklund; Shay B. Cohen; Frank Drewes; Giorgio Satta (Theor. Comput. Sci., 2021)

Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2022)

Dynamic Topic Modeling by Clustering Embeddings from Pretrained Language Models: A Research Proposal. - Anton Eklund; Mona Forsman; Frank Drewes (AACL/IJCNLP 2022 (Student Research Workshop), 2022)

Improved N-Best Extraction with an Evaluation on Language Data. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Comput. Linguistics, 2022)

An Algebraic Approach to Learning and Grounding. - Johanna Björklund; Adam Dahlgren Lindström; Frank Drewes (CoRR, 2022)

ADCluster: Adaptive Deep Clustering for Unsupervised Learning from Unlabeled Documents. - Arezoo Hatefi; Xuan-Son Vu; Monowar H. Bhuyan; Frank Drewes (ICNLSP, 2023)

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies. - Johanna Björklund; Frank Drewes; Anna Jonsson 001 (Comput. Linguistics, 2023)

Generating Semantic Graph Corpora with Graph Expansion Grammar. - Eric Andersson; Johanna Björklund; Frank Drewes; Anna Jonsson 001 (NCMA, 2023)

Finite Automata for Efficient Graph Recognition. - Frank Drewes; Berthold Hoffmann; Mark Minas (GCM, 2023)

Hybrid tree automata and the yield theorem for constituent tree automata. - Frank Drewes; Richard Mörbitz; Heiko Vogler (Theor. Comput. Sci., 2023)

On the power of local graph expansion grammars with and without additional restrictions. - Frank Drewes; Yannick Stade (Theor. Comput. Sci., 2024)

Optimal strategies for the static black-peg AB game with two and three pegs. - Gerold Jäger; Frank Drewes (Discret. Math. Algorithms Appl., 2024)

Specifying and Checking Graph Properties with Alternating Graph Automata. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2025)

Graph Formulas and Their Translation to Alternating Graph Automata. - Frank Drewes; Berthold Hoffmann; Mark Minas (ICGT, 2025)

Dynamically Weighted Tree Transducers. - Frank Drewes; Marco Kuhlmann; Olle Torstensson (CIAA, 2025)

The Efficiency of Pre-training with Objective Masking in Pseudo Labeling for Semi-Supervised Text Classification. - Arezoo Hatefi; Xuan-Son Vu; Monowar H. Bhuyan; Frank Drewes (CoRR, 2025)