| Publication | Date of Publication | Type |
|---|
| Optimal strategies for the static black-peg AB game with two and three pegs | 2024-11-13 | Paper |
| On the power of local graph expansion grammars with and without additional restrictions | 2024-10-07 | Paper |
| Hybrid tree automata and the yield theorem for constituent tree automata | 2023-10-26 | Paper |
| Incremental termination proofs and the length of derivations | 2022-12-09 | Paper |
| Criteria to disprove context-freeness of collage languages | 2022-12-09 | Paper |
| Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power | 2022-12-07 | Paper |
| Hyperedge replacement with rendezvous | 2022-11-02 | Paper |
| Optimal Strategies for Static Black-Peg AB Game With Two and Three Pegs | 2022-10-10 | Paper |
| Graph parsing as graph transformation. Correctness of predictive top-down parsers | 2022-09-01 | Paper |
| Hybrid tree automata and the yield theorem for constituent tree automata | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094884 | 2022-08-04 | Paper |
| Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars | 2022-03-21 | Paper |
| Analyzing catastrophic backtracking behavior in practical regular expression matching | 2021-06-22 | Paper |
| Bottom-up unranked tree-to-graph transducers for translation into semantic graphs | 2021-06-03 | Paper |
| Uniform parsing for hyperedge replacement grammars | 2021-03-10 | Paper |
| Term graph rewriting and parallel term rewriting | 2021-03-03 | Paper |
| Z-automata for compact and direct representation of unranked tree languages | 2020-05-06 | Paper |
| Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars | 2020-02-06 | Paper |
| The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) | 2020-01-16 | Paper |
| Predictive shift-reduce parsing for hyperedge replacement grammars | 2019-11-22 | Paper |
| Language theoretic properties of regular DAG languages | 2019-09-17 | Paper |
| On DAG languages and DAG transducers | 2019-07-03 | Paper |
| Efficient enumeration of weighted tree languages over the tropical semiring | 2019-06-25 | Paper |
| Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement | 2019-06-20 | Paper |
| The use of tree transducers to compute translations between graph algebras | 2019-01-10 | Paper |
| An optimal strategy for static black-peg mastermind with three pegs | 2018-11-08 | Paper |
| A comparison of two \(N\)-best extraction methods for weighted tree automata | 2018-11-07 | Paper |
| The output size problem for string-to-tree transducers | 2018-09-17 | Paper |
| Tight bounds for cut-operations on deterministic finite automata | 2018-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4599177 | 2017-12-18 | Paper |
| DAG automata for meaning representation | 2017-12-18 | Paper |
| Finding the \(N\) best vertices in an infinite weighted hypergraph | 2017-06-15 | Paper |
| Context-free tree grammars are as powerful as context-free jungle grammars | 2016-05-03 | Paper |
| Properties of regular DAG languages | 2016-04-13 | Paper |
| Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars | 2016-04-13 | Paper |
| An efficient best-trees algorithm for weighted tree automata over the tropical semiring | 2016-04-08 | Paper |
| The generative power of delegation networks | 2015-12-07 | Paper |
| Predictive top-down parsing for hyperedge replacement grammars | 2015-09-22 | Paper |
| Tight bounds for cut-operations on deterministic finite automata | 2015-09-15 | Paper |
| Contextual hyperedge replacement | 2015-09-11 | Paper |
| Graph transformation for incremental natural language analysis | 2014-03-28 | Paper |
| Cuts in regular expressions | 2013-06-28 | Paper |
| MAT learners for tree series: an abstract data type and two realizations | 2012-03-23 | Paper |
| Selected Decision Problems for Square-Refinement Collage Grammars | 2011-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077184 | 2011-02-22 | Paper |
| Algorithmic Properties of Millstream Systems | 2010-08-31 | Paper |
| Adaptive star grammars and their languages | 2010-08-11 | Paper |
| Links | 2010-01-29 | Paper |
| Bag Context Tree Grammars | 2009-03-26 | Paper |
| Bag context tree grammars | 2009-02-12 | Paper |
| Adaptive Star Grammars | 2008-11-27 | Paper |
| Adaptive Star Grammars for Graph Models | 2008-11-20 | Paper |
| From Tree-Based Generators to Delegation Networks | 2008-09-04 | Paper |
| An Algebra for Tree-Based Music Generation | 2008-09-04 | Paper |
| Learning deterministically recognizable tree series | 2008-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450110 | 2008-03-19 | Paper |
| Query learning of regular tree languages: How to avoid dead states | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485981 | 2006-09-06 | Paper |
| Grammatical picture generation. A tree-based approach. With CD-ROM. | 2005-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819885 | 2004-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820790 | 2004-10-01 | Paper |
| Branching synchronization grammars with nested tables | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452069 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452068 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431346 | 2003-10-21 | Paper |
| Criteria to disprove context freeness of collage languages. | 2003-08-17 | Paper |
| The complexity of the exponential output size problem for top-down and bottom-up tree transducers | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782112 | 2002-11-27 | Paper |
| Decidability of the finiteness of ranges of tree transductions | 2002-11-24 | Paper |
| Table-driven and context-sensitive collage languages | 2002-11-04 | Paper |
| Hierarchical graph transformation | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540980 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540961 | 2002-07-28 | Paper |
| Tree-based generation of languages of fractals | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753855 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502801 | 2001-04-19 | Paper |
| Tree-based picture generation | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508296 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954444 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934332 | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699299 | 1999-11-10 | Paper |
| A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars | 1999-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222793 | 1998-12-13 | Paper |
| Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid | 1997-03-31 | Paper |
| Generating self-affine fractals by collage grammars | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4890711 | 1996-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874658 | 1996-08-13 | Paper |
| Recognising \(k\)-connected hypergraphs in cubic time | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037291 | 1993-05-18 | Paper |
| NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) | 1993-05-16 | Paper |
| Some modifications of auxiliary pushdown automata | 1991-01-01 | Paper |
