| Publication | Date of Publication | Type |
|---|
| Dynamically weighted tree transducers | 2026-02-10 | Paper |
| Finite automata for efficient graph recognition | 2025-09-03 | Paper |
| Generating semantic graph corpora with graph expansion grammar | 2025-08-19 | Paper |
Optimal strategies for the static black-peg AB game with two and three pegs
Discrete Mathematics, Algorithms and Applications | 2024-11-13 | Paper |
On the power of local graph expansion grammars with and without additional restrictions
Theoretical Computer Science | 2024-10-07 | Paper |
Hybrid tree automata and the yield theorem for constituent tree automata
Theoretical Computer Science | 2023-10-26 | Paper |
Incremental termination proofs and the length of derivations
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Criteria to disprove context-freeness of collage languages
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power | 2022-12-07 | Paper |
Hyperedge replacement with rendezvous
Lecture Notes in Computer Science | 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
Graph Transformation | 2022-09-01 | Paper |
| Hybrid tree automata and the yield theorem for constituent tree automata | 2022-08-16 | Paper |
| scientific article; zbMATH DE number 7568231 (Why is no real title available?) | 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 |
Analyzing catastrophic backtracking behavior in practical regular expression matching
(available as arXiv preprint) | 2021-06-22 | Paper |
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
Theoretical Computer Science | 2021-06-03 | Paper |
Uniform parsing for hyperedge replacement grammars
Journal of Computer and System Sciences | 2021-03-10 | Paper |
| Term graph rewriting and parallel term rewriting | 2021-03-03 | Paper |
Term graph rewriting and parallel term rewriting
(available as arXiv preprint) | 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 \)
Theoretical Computer Science | 2020-01-16 | Paper |
Predictive shift-reduce parsing for hyperedge replacement grammars
Graph Transformation | 2019-11-22 | Paper |
Language theoretic properties of regular DAG languages
Information and Computation | 2019-09-17 | Paper |
| On DAG languages and DAG transducers | 2019-07-03 | Paper |
Efficient enumeration of weighted tree languages over the tropical semiring
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
The use of tree transducers to compute translations between graph algebras
Lecture Notes in Computer Science | 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
Fundamenta Informaticae | 2018-01-19 | Paper |
| scientific article; zbMATH DE number 6819785 (Why is no real title available?) | 2017-12-18 | Paper |
| DAG automata for meaning representation | 2017-12-18 | Paper |
Finding the \(N\) best vertices in an infinite weighted hypergraph
Theoretical Computer Science | 2017-06-15 | Paper |
Context-free tree grammars are as powerful as context-free jungle grammars
Acta Cybernetica | 2016-05-03 | Paper |
Properties of regular DAG languages
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
Language and Automata Theory and Applications | 2016-04-13 | Paper |
An efficient best-trees algorithm for weighted tree automata over the tropical semiring
Language and Automata Theory and Applications | 2016-04-08 | Paper |
The generative power of delegation networks
Information and Computation | 2015-12-07 | Paper |
Predictive top-down parsing for hyperedge replacement grammars
Graph Transformation | 2015-09-22 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Contextual hyperedge replacement
Acta Informatica | 2015-09-11 | Paper |
Graph transformation for incremental natural language analysis
Theoretical Computer Science | 2014-03-28 | Paper |
Cuts in regular expressions
Developments in Language Theory | 2013-06-28 | Paper |
MAT learners for tree series: an abstract data type and two realizations
Acta Informatica | 2012-03-23 | Paper |
Selected Decision Problems for Square-Refinement Collage Grammars
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
| scientific article; zbMATH DE number 5854939 (Why is no real title available?) | 2011-02-22 | Paper |
Algorithmic Properties of Millstream Systems
Developments in Language Theory | 2010-08-31 | Paper |
Adaptive star grammars and their languages
Theoretical Computer Science | 2010-08-11 | Paper |
Links
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Bag Context Tree Grammars
Developments in Language Theory | 2009-03-26 | Paper |
| Bag context tree grammars | 2009-02-12 | Paper |
Adaptive Star Grammars
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Adaptive Star Grammars for Graph Models
Lecture Notes in Computer Science | 2008-11-20 | Paper |
From Tree-Based Generators to Delegation Networks
Algebraic Informatics | 2008-09-04 | Paper |
An Algebra for Tree-Based Music Generation
Algebraic Informatics | 2008-09-04 | Paper |
| Learning deterministically recognizable tree series | 2008-08-12 | Paper |
| scientific article; zbMATH DE number 5251101 (Why is no real title available?) | 2008-03-19 | Paper |
Query learning of regular tree languages: How to avoid dead states
Theory of Computing Systems | 2007-02-14 | Paper |
| scientific article; zbMATH DE number 5051554 (Why is no real title available?) | 2006-09-06 | Paper |
Grammatical picture generation. A tree-based approach. With CD-ROM.
Texts in Theoretical Computer Science. An EATCS Series | 2005-05-26 | Paper |
| scientific article; zbMATH DE number 2106354 (Why is no real title available?) | 2004-10-05 | Paper |
| scientific article; zbMATH DE number 2104763 (Why is no real title available?) | 2004-10-01 | Paper |
Branching synchronization grammars with nested tables
Journal of Computer and System Sciences | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2040913 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2040912 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1995128 (Why is no real title available?) | 2003-10-21 | Paper |
Criteria to disprove context freeness of collage languages.
Theoretical Computer Science | 2003-08-17 | Paper |
The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1836427 (Why is no real title available?) | 2002-11-27 | Paper |
Decidability of the finiteness of ranges of tree transductions
Information and Computation | 2002-11-24 | Paper |
| Table-driven and context-sensitive collage languages | 2002-11-04 | Paper |
Hierarchical graph transformation
Journal of Computer and System Sciences | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1773095 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1773078 (Why is no real title available?) | 2002-07-28 | Paper |
Tree-based generation of languages of fractals
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1670610 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1504823 (Why is no real title available?) | 2001-04-19 | Paper |
Tree-based picture generation
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1512612 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1456955 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1390067 (Why is no real title available?) | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1361481 (Why is no real title available?) | 1999-11-10 | Paper |
A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
Theory of Computing Systems | 1999-03-22 | Paper |
| scientific article; zbMATH DE number 1231486 (Why is no real title available?) | 1998-12-13 | Paper |
Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Generating self-affine fractals by collage grammars
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 919846 (Why is no real title available?) | 1996-08-25 | Paper |
| scientific article; zbMATH DE number 871244 (Why is no real title available?) | 1996-08-13 | Paper |
Recognising \(k\)-connected hypergraphs in cubic time
Theoretical Computer Science | 1994-01-19 | Paper |
| scientific article; zbMATH DE number 177418 (Why is no real title available?) | 1993-05-18 | Paper |
NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
Information Processing Letters | 1993-05-16 | Paper |
Some modifications of auxiliary pushdown automata
RAIRO - Theoretical Informatics and Applications | 1991-01-01 | Paper |
