Frank Drewes

According to our database1, Frank Drewes authored at least 102 papers between 1990 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
The Output Size Problem for String-to-Tree Transducers.
Journal of Automata, Languages and Combinatorics, 2018

Weighted DAG Automata for Semantic Graphs.
Computational Linguistics, 2018

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata.
Proceedings of the Implementation and Application of Automata, 2018

An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

On regular expressions with backreferences and transducers.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2017
Preface.
Theor. Comput. Sci., 2017

Finding the N best vertices in an infinite weighted hypergraph.
Theor. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Fundam. Inform., 2017

On DAG Languages and DAG Transducers.
Bulletin of the EATCS, 2017

Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations.
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.
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2017

DAG Automata for Meaning Representation.
Proceedings of the 15th Meeting on the Mathematics of Language, 2017

Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars.
Proceedings of the Graph Transformation - 10th International Conference, 2017

2016
Approximating Parikh Images for Generating Deterministic Graph Parsers.
Proceedings of the Software Technologies: Applications and Foundations, 2016

Properties of Regular DAG Languages.
Proceedings of the Language and Automata Theory and Applications, 2016

Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
The generative power of delegation networks.
Inf. Comput., 2015

Preface.
Fundam. Inform., 2015

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

Structurally Cyclic Petri Nets.
Logical Methods in Computer Science, 2015

Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars.
Acta Cybern., 2015

Contextual hyperedge replacement.
Acta Inf., 2015

Grammatical inference of graph transformation rules.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring.
Proceedings of the Language and Automata Theory and Applications, 2015

MICO - Media in Context.
Proceedings of the 2015 IEEE International Conference on Multimedia & Expo Workshops, 2015

Predictive Top-Down Parsing for Hyperedge Replacement Grammars.
Proceedings of the Graph Transformation - 8th International Conference, 2015

2014
Graph transformation for incremental natural language analysis.
Theor. Comput. Sci., 2014

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

2013
On the Parameterized Complexity of Linear Context-Free Rewriting Systems.
Proceedings of the 13th Meeting on the Mathematics of Language, 2013

Cuts in Regular Expressions.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract).
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2011
Term Graph Rewriting and Parallel Term Rewriting
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.
Acta Inf., 2011

Incremental Construction of Millstream Configurations Using Graph Transformation.
Proceedings of the Finite-State Methods and Natural Language Processing, 2011

Selected Decision Problems for Square-Refinement Collage Grammars.
Proceedings of the Algebraic Foundations in Computer Science, 2011

Contextual Hyperedge Replacement.
Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2011

2010
Adaptive star grammars and their languages.
Theor. Comput. Sci., 2010

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday.
ECEASST, 2010

Towards the Tree Automata Workbench Marbles.
ECEASST, 2010

On the Complexity of Variants of the k Best Strings Problem.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Algorithmic Properties of Millstream Systems.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

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

Millstream Systems - a Formal Model for Linking Language Modules by Interfaces.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009
MAT Learners for Recognizable Tree Languages and Tree Series.
Acta Cybern., 2009

2008
Bag Context Tree Grammars.
Fundam. Inform., 2008

Path Languages of Random Permitting Context Tree Grammars are Regular.
Fundam. Inform., 2008

Adaptive Star Grammars for Graph Models.
Proceedings of the Graph Transformations, 4th International Conference, 2008

2007
Query Learning of Regular Tree Languages: How to Avoid Dead States.
Theory Comput. Syst., 2007

Learning Deterministically Recognizable Tree Series.
Journal of Automata, Languages and Combinatorics, 2007

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

An Algebra for Tree-Based Music Generation.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

From Tree-Based Generators to Delegation Networks.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

Shaped Generic Graph Transformation.
Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2007

2006
Grammatical Picture Generation - A Tree-Based Approach
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-32507-9, 2006

Adaptive Star Grammars.
Proceedings of the Graph Transformations, Third International Conference, 2006

Bag Context Tree Grammars.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Random context tree grammars and tree transducers.
South African Computer Journal, 2005

Rule-Based Programming with Diaplan.
Electr. Notes Theor. Comput. Sci., 2005

2004
Branching synchronization grammars with nested tables.
J. Comput. Syst. Sci., 2004

2003
Criteria to disprove context freeness of collage languages.
Theor. Comput. Sci., 2003

Table-Driven and Context-Sensitive Collage Languages.
Journal of Automata, Languages and Combinatorics, 2003

Computing Raster Images from Grid Picture Grammars.
Journal of Automata, Languages and Combinatorics, 2003

Learning a Regular Tree Language from a Teacher.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Branching Grammars: A Generalization of ET0L Systems.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Hierarchical Graph Transformation.
J. Comput. Syst. Sci., 2002

2001
Tree-based generation of languages of fractals.
Theor. Comput. Sci., 2001

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

Reading words in graphs generated by hyperedge replacement.
Proceedings of the Where Mathematics, 2001

2000
Tree-based picture generation.
Theor. Comput. Sci., 2000

TREEBAG.
Proceedings of the Implementation and Application of Automata, 2000

Computing Raster Images from Grid Picture Grammars.
Proceedings of the Implementation and Application of Automata, 2000

Hierarchical Graph Transformation.
Proceedings of the Foundations of Software Science and Computation Structures, 2000

Picking Knots from Trees - The Syntactic Structure of Celtic Knotwork.
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.
Theory Comput. Syst., 1999

Exponential Output Size of Top-Down Tree Transducers.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Table-driven and context-sensitive collage languages.
Proceedings of the Developments in Language Theory, 1999

Graph Transformation Modules and Their Composition.
Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

TREEBAG - a Short Presentation.
Proceedings of the Applications of Graph Transformations with Industrial Relevance, 1999

1998
Decidability of the Finiteness of Ranges of Tree Transductions.
Inf. Comput., 1998

Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars.
Proceedings of the Theory and Application of Graph Transformations, 1998

TREEBAG - Baum-basierte Generierung und Transformation von Objekten.
Proceedings of the Informatik '98, 1998

1997
On the Generation of Trees by Hyperedge Replacement.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

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

Criteria to Disprove Context-Freeness of Collage Languages.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

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

(Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars.
Fundam. Inform., 1996

A Lower Bound on the Growth of Functions Computed by Tree Transducers.
Fundam. Inform., 1996

Computation by tree transductions.
PhD thesis, 1996

1995
Generating Self-Affine Fractals by Collage Grammars.
Theor. Comput. Sci., 1995

Semirings and tree-to-graph-to-tree transductions.
Electr. Notes Theor. Comput. Sci., 1995

On the Connectedness of Pictures Defined by Iterated Function Systems.
Proceedings of the Developments in Language Theory II, 1995

1994
The Use of Tree Transducers to Compute Translations Between Graph Algebras.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

A Lower Bound on the Growth of Functions Computed by Tree Transductions.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Recognising k-Connected Hypergraphs in Cubic Time.
Theor. Comput. Sci., 1993

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

A scetch of Collage Grammars.
Bulletin of the EATCS, 1993

Hyperedge Replacement with Rendevous.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Generating Self-Affine Fractals by Collage Grammars.
Proceedings of the Developments in Language Theory, 1993

1991
Some modifications of auxiliary pushdown automata.
ITA, 1991

Incremental Termination Proofs and the Length of Derivations.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
A Note on Hyperedge Replacement.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990


  Loading...