Frank Drewes

According to our database, Frank Drewes authored at least 121 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Optimal strategies for the static black-peg AB game with two and three pegs.

Gerold Jäger, Frank Drewes

Discret. Math. Algorithms Appl., May, 2024

On the power of local graph expansion grammars with and without additional restrictions.

Frank Drewes, Yannick Stade

Theor. Comput. Sci., 2024

Finite Automata for Efficient Graph Recognition.

Frank Drewes, Berthold Hoffmann, Mark Minas

CoRR, 2024

2023

Hybrid tree automata and the yield theorem for constituent tree automata.

Frank Drewes, Richard Mörbitz, Heiko Vogler

Theor. Comput. Sci., November, 2023

Generating Semantic Graph Corpora with Graph Expansion Grammar.

Eric Andersson, Johanna Björklund, Frank Drewes, Anna Jonsson

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies.

Johanna Björklund, Frank Drewes, Anna Jonsson

Comput. Linguistics, 2023

ADCluster: Adaptive Deep Clustering for Unsupervised Learning from Unlabeled Documents.

Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes

Proceedings of the 6th International Conference on Natural Language and Speech Processing (ICNLSP 2023), 2023

2022

An Algebraic Approach to Learning and Grounding.

Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes

CoRR, 2022

Improved N-Best Extraction with an Evaluation on Language Data.

Johanna Björklund, Frank Drewes, Anna Jonsson

Comput. Linguistics, 2022

Dynamic Topic Modeling by Clustering Embeddings from Pretrained Language Models: A Research Proposal.

Anton Eklund, Mona Forsman, Frank Drewes

Proceedings of the 2nd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 12th International Joint Conference on Natural Language Processing, 2022

Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 15th International Conference, 2022

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

Uniform parsing for hyperedge replacement grammars.

Henrik Björklund, Frank Drewes, Petter Ericson, Florian Starke

J. Comput. Syst. Sci., 2021

Polynomial Graph Parsing with Non-Structural Reentrancies.

Johanna Björklund, Frank Drewes, Anna Jonsson

CoRR, 2021

Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 14th International Conference, 2021

Bridging Perception, Memory, and Inference through Semantic Relations.

Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes

Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

Cformer: Semi-Supervised Text Clustering Based on Pseudo Labeling.

Arezoo Hatefi, Xuan-Son Vu, Monowar H. Bhuyan, Frank Drewes

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020

The metric dimension of Zn×Zn×Zn is ⌊3<i>n</i>/2⌋.

Gerold Jäger, Frank Drewes

Theor. Comput. Sci., 2020

Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 13th International Conference, 2020

Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case.

Adam Dahlgren Lindström, Johanna Björklund, Suna Bensch, Frank Drewes

Proceedings of the 28th International Conference on Computational Linguistics, 2020

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

Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue.

Frank Drewes, Makoto Kanazawa

J. Lang. Model., 2019

Efficient enumeration of weighted tree languages over the tropical semiring.

Johanna Björklund, Frank Drewes, Niklas Zechner

J. Comput. Syst. Sci., 2019

Language theoretic properties of regular DAG languages.

Johannes Blum, Frank Drewes

Inf. Comput., 2019

Z-Automata for Compact and Direct Representation of Unranked Tree Languages.

Johanna Björklund, Frank Drewes, Giorgio Satta

Proceedings of the Implementation and Application of Automata, 2019

Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 12th International Conference, 2019

A Survey of Recent Advances in Efficient Parsing for Graph Grammars.

Frank Drewes

Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

2018

The Output Size Problem for String-to-Tree Transducers.

Martin Berglund, Frank Drewes, Brink van der Merwe

J. Autom. Lang. Comb., 2018

Weighted DAG Automata for Semantic Graphs.

David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta

Comput. Linguistics, 2018

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata.

Johanna Björklund, Frank Drewes, Anna Jonsson

Proceedings of the Implementation and Application of Automata, 2018

An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs.

Gerold Jäger, Frank Drewes

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

On regular expressions with backreferences and transducers.

Martin Berglund, Frank Drewes, Brink van der Merwe

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2017

Preface.

Frank Drewes

Theor. Comput. Sci., 2017

Finding the N best vertices in an infinite weighted hypergraph.

Johanna Björklund, Frank Drewes, Anna Jonsson

Theor. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.

Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe

Fundam. Informaticae, 2017

On DAG Languages and DAG Transducers.

Frank Drewes

Bull. EATCS, 2017

Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations.

Frank Drewes, Anna Jonsson

Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017

Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages.

Martin Berglund, Henrik Björklund, Frank Drewes

Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017

DAG Automata for Meaning Representation.

Frank Drewes

Proceedings of the 15th Meeting on the Mathematics of Language, 2017

Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 10th International Conference, 2017

2016

Approximating Parikh Images for Generating Deterministic Graph Parsers.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Software Technologies: Applications and Foundations, 2016

Properties of Regular DAG Languages.

Johannes Blum, Frank Drewes

Proceedings of the Language and Automata Theory and Applications, 2016

Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars.

Henrik Björklund, Frank Drewes, Petter Ericson

Proceedings of the Language and Automata Theory and Applications, 2016

2015

The generative power of delegation networks.

Frank Drewes, Joost Engelfriet

Inf. Comput., 2015

Preface.

Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto

Fundam. Informaticae, 2015

Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122).

Frank Drewes, Kevin Knight, Marco Kuhlmann

Dagstuhl Reports, 2015

Structurally Cyclic Petri Nets.

Frank Drewes, Jérôme Leroux

Log. Methods Comput. Sci., 2015

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars.

Frank Drewes, Joost Engelfriet

Acta Cybern., 2015

Contextual hyperedge replacement.

Frank Drewes, Berthold Hoffmann

Acta Informatica, 2015

Grammatical inference of graph transformation rules.

Suna Bensch, Frank Drewes, Thomas Hellström

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring.

Johanna Björklund, Frank Drewes, Niklas Zechner

Proceedings of the Language and Automata Theory and Applications, 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

Proceedings of the 2015 IEEE International Conference on Multimedia & Expo Workshops, 2015

Predictive Top-Down Parsing for Hyperedge Replacement Grammars.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformation - 8th International Conference, 2015

2014

Graph transformation for incremental natural language analysis.

Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe

Theor. Comput. Sci., 2014

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching.

Martin Berglund, Frank Drewes, Brink van der Merwe

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

2013

On the Parameterized Complexity of Linear Context-Free Rewriting Systems.

Martin Berglund, Henrik Björklund, Frank Drewes

Proceedings of the 13th Meeting on the Mathematics of Language, 2013

Cuts in Regular Expressions.

Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract).

Frank Drewes

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2011

Term Graph Rewriting and Parallel Term Rewriting

Andrea Corradini, Frank Drewes

Proceedings of the Proceedings 6th International Workshop on Computing with Terms and Graphs, 2011

MAT learners for tree series: an abstract data type and two realizations.

Frank Drewes, Johanna Högberg, Andreas Maletti

Acta Informatica, 2011

Incremental Construction of Millstream Configurations Using Graph Transformation.

Suna Bensch, Frank Drewes, Helmut Jürgensen, Brink van der Merwe

Proceedings of the Finite-State Methods and Natural Language Processing, 2011

Selected Decision Problems for Square-Refinement Collage Grammars.

Frank Drewes

Proceedings of the Algebraic Foundations in Computer Science, 2011

Contextual Hyperedge Replacement.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2011

2010

Adaptive star grammars and their languages.

Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas

Theor. Comput. Sci., 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

Towards the Tree Automata Workbench Marbles.

Frank Drewes

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

On the Complexity of Variants of the <i>k</i> Best Strings Problem.

Martin Berglund, Frank Drewes

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Algorithmic Properties of Millstream Systems.

Suna Bensch, Henrik Björklund, Frank Drewes

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Millstream Systems - a Formal Model for Linking Language Modules by Interfaces.

Suna Bensch, Frank Drewes

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009

MAT Learners for Recognizable Tree Languages and Tree Series.

Frank Drewes

Acta Cybern., 2009

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

Path Languages of Random Permitting Context Tree Grammars are Regular.

Frank Drewes, Brink van der Merwe

Fundam. Informaticae, 2008

Adaptive Star Grammars for Graph Models.

Frank Drewes, Berthold Hoffmann, Mark Minas

Proceedings of the Graph Transformations, 4th International Conference, 2008

2007

Query Learning of Regular Tree Languages: How to Avoid Dead States.

Frank Drewes, Johanna Högberg

Theory Comput. Syst., 2007

Learning Deterministically Recognizable Tree Series.

Frank Drewes, Heiko Vogler

J. Autom. Lang. Comb., 2007

Links.

Frank Drewes

Int. J. Found. Comput. Sci., 2007

An Algebra for Tree-Based Music Generation.

Frank Drewes, Johanna Högberg

Proceedings of the Algebraic Informatics, Second International Conference, 2007

From Tree-Based Generators to Delegation Networks.

Frank Drewes

Proceedings of the Algebraic Informatics, Second International Conference, 2007

Shaped Generic Graph Transformation.

Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2007

2006

Grammatical Picture Generation - A Tree-Based Approach

Frank Drewes

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-32507-9, 2006

Adaptive Star Grammars.

Frank Drewes, Berthold Hoffmann, Dirk Janssens, Mark Minas, Niels Van Eetvelde

Proceedings of the Graph Transformations, Third International Conference, 2006

2005

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

2004

Branching synchronization grammars with nested tables.

Frank Drewes, Joost Engelfriet

J. Comput. Syst. Sci., 2004

Rule-Based Programming with Diaplan.

Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas

Proceedings of the 2nd International Workshop on Graph-Based Tools, 2004

2003

Criteria to disprove context freeness of collage languages.

Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire

Theor. Comput. Sci., 2003

Table-Driven and Context-Sensitive Collage Languages.

Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski

J. Autom. Lang. Comb., 2003

Computing Raster Images from Grid Picture Grammars.

Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski

J. Autom. Lang. Comb., 2003

Learning a Regular Tree Language from a Teacher.

Frank Drewes, Johanna Högberg

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Branching Grammars: A Generalization of ET0L Systems.

Frank Drewes, Joost Engelfriet

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Hierarchical Graph Transformation.

Frank Drewes, Berthold Hoffmann, Detlef Plump

J. Comput. Syst. Sci., 2002

2001

Tree-based generation of languages of fractals.

Frank Drewes

Theor. Comput. Sci., 2001

The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers.

Frank Drewes

Inf. Comput., 2001

Reading words in graphs generated by hyperedge replacement.

Frank Drewes, Hans-Jörg Kreowski

Proceedings of the Where Mathematics, 2001

2000

Tree-based picture generation.

Frank Drewes

Theor. Comput. Sci., 2000

TREEBAG.

Frank Drewes, Renate Klempien-Hinrichs

Proceedings of the Implementation and Application of Automata, 2000

Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork.

Frank Drewes, Renate Klempien-Hinrichs

Proceedings of the Theory and Application of Diagrams, First International Conference, 2000

1999

A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars.

Frank Drewes

Theory Comput. Syst., 1999

Exponential Output Size of Top-Down Tree Transducers.

Frank Drewes

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Graph Transformation Modules and Their Composition.

Frank Drewes, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

TREEBAG - a Short Presentation.

Frank Drewes, Peter Knirsch

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

1998

Decidability of the Finiteness of Ranges of Tree Transductions.

Frank Drewes, Joost Engelfriet

Inf. Comput., 1998

Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars.

Frank Drewes

Proceedings of the Theory and Application of Graph Transformations, 1998

TREEBAG - Baum-basierte Generierung und Transformation von Objekten.

Frank Drewes

Proceedings of the Informatik '98, 1998

1997

On the Generation of Trees by Hyperedge Replacement.

Frank Drewes

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Hyperedge Replacement, Graph Grammars.

Frank Drewes, Hans-Jörg Kreowski, Annegret Habel

Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

1996

Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid.

Frank Drewes

J. Comput. Syst. Sci., 1996

(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars.

Frank Drewes, Hans-Jörg Kreowski

Fundam. Informaticae, 1996

A Lower Bound on the Growth of Functions Computed by Tree Transducers.

Frank Drewes

Fundam. Informaticae, 1996

Computation by tree transductions.

Frank Drewes

PhD thesis, 1996

1995

Generating Self-Affine Fractals by Collage Grammars.

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger

Theor. Comput. Sci., 1995

Semirings and tree-to-graph-to-tree transductions.

Frank Drewes

Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

On the Connectedness of Pictures Defined by Iterated Function Systems.

Frank Drewes

Proceedings of the Developments in Language Theory II, 1995

1994

The Use of Tree Transducers to Compute Translations Between Graph Algebras.

Frank Drewes

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

A Lower Bound on the Growth of Functions Computed by Tree Transductions.

Frank Drewes

Proceedings of the Trees in Algebra and Programming, 1994

1993

Recognising k-Connected Hypergraphs in Cubic Time.

Frank Drewes

Theor. Comput. Sci., 1993

NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k.

Frank Drewes

Inf. Process. Lett., 1993

A scetch of Collage Grammars.

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger

Bull. EATCS, 1993

Hyperedge Replacement with Rendevous.

N. Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1991

Some modifications of auxiliary pushdown automata.

Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski

RAIRO Theor. Informatics Appl., 1991

Incremental Termination Proofs and the Length of Derivations.

Frank Drewes, Clemens Lautemann

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

A Note on Hyperedge Replacement.

Frank Drewes, Hans-Jörg Kreowski

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990