| Publication | Date of Publication | Type |
|---|
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited
International Journal of Foundations of Computer Science | 2023-08-16 | Paper |
Bottom-up tree pushdown automata and rewrite systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Deterministic top-down tree automata with Boolean deterministic look-ahead
Theoretical Computer Science | 2022-08-10 | Paper |
Some decidability results on one-pass reductions
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
Theoretical Computer Science | 2018-06-07 | Paper |
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
Information Processing Letters | 2018-04-04 | Paper |
Minimization of deterministic top-down tree automata
Acta Cybernetica | 2017-08-25 | Paper |
| Recognizing relations by tree automata | 2016-12-16 | Paper |
One-pass reductions
Acta Cybernetica | 2016-09-09 | Paper |
| Tree homomorphisms for unranked trees | 2016-07-26 | Paper |
On ground word problem of term equation systems
Acta Cybernetica | 2016-05-03 | Paper |
Symbol different term rewrite systems
Journal of Logical and Algebraic Methods in Programming | 2015-08-21 | Paper |
Tree shuffle
Theoretical Computer Science | 2014-01-22 | Paper |
Rewriting preserving recognizability of finite tree languages
The Journal of Logic and Algebraic Programming | 2013-02-21 | Paper |
| Ground term rewriting | 2013-01-28 | Paper |
CHAP and rewrite components
Acta Informatica | 2012-03-23 | Paper |
Murg term rewrite systems
Information Processing Letters | 2010-06-09 | Paper |
Congruences generated by extended ground term rewrite systems
Fundamenta Informaticae | 2010-02-05 | Paper |
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters | 2010-01-29 | Paper |
| scientific article; zbMATH DE number 5654542 (Why is no real title available?) | 2010-01-07 | Paper |
| scientific article; zbMATH DE number 5604113 (Why is no real title available?) | 2009-09-15 | Paper |
Deterministic bottom-up tree transducers and ground term rewrite systems
Theoretical Computer Science | 2009-05-28 | Paper |
Losing recognizability
Theoretical Computer Science | 2007-07-16 | Paper |
SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
Storage-to-tree transducers with look-ahead
Theoretical Computer Science | 2005-02-09 | Paper |
Right-linear half-monadic term rewrite systems
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2087222 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1995182 (Why is no real title available?) | 2003-10-21 | Paper |
On ground tree transformations and congruences induced by tree automata.
Theoretical Computer Science | 2003-08-17 | Paper |
Term rewriting restricted to ground terms.
Theoretical Computer Science | 2003-08-17 | Paper |
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science | 2003-07-30 | Paper |
The ground tree transducer game with identical tree automata
Fundamenta Informaticae | 2001-12-11 | Paper |
| scientific article; zbMATH DE number 1507044 (Why is no real title available?) | 2001-09-04 | Paper |
Restricted ground tree transducers
Theoretical Computer Science | 2000-12-12 | Paper |
Congruential complements of ground term rewrite systems
Theoretical Computer Science | 2000-08-21 | Paper |
A property of left-linear rewrite systems preserving recognizability
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1354853 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1337744 (Why is no real title available?) | 1999-09-16 | Paper |
| scientific article; zbMATH DE number 1192316 (Why is no real title available?) | 1998-08-20 | Paper |
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science | 1998-08-13 | Paper |
Deterministic top-down tree transducers with iterated look-ahead
Theoretical Computer Science | 1997-02-28 | Paper |
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
Theoretical Computer Science | 1997-02-27 | Paper |
A hierarchy of deterministic top-down tree transformations
Mathematical Systems Theory | 1996-06-27 | Paper |
Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
Information and Computation | 1995-12-19 | Paper |
Minimal equational representations of recognizable tree languages
Acta Informatica | 1995-11-15 | Paper |
| scientific article; zbMATH DE number 475426 (Why is no real title available?) | 1994-07-28 | Paper |
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Theoretical Computer Science | 1994-05-15 | Paper |
| scientific article; zbMATH DE number 522869 (Why is no real title available?) | 1994-04-17 | Paper |
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
Theoretical Computer Science | 1993-10-03 | Paper |
Tree transducers with external functions
Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 58292 (Why is no real title available?) | 1992-09-27 | Paper |
Top-down tree transducers with two-way tree walking look-ahead
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17541 (Why is no real title available?) | 1992-06-26 | Paper |
A complete classification of deterministic root-to-frontier tree transformation classes
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4157904 (Why is no real title available?) | 1990-01-01 | Paper |
A complete rewriting system for a monoid of tree transformation classes
Information and Computation | 1990-01-01 | Paper |
The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations
Information Processing Letters | 1990-01-01 | Paper |
Top-down tree transducers with deterministic top-down look-ahead
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4135419 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164139 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4108162 (Why is no real title available?) | 1988-01-01 | Paper |
Variants of top-down tree transducers with look-ahead
Mathematical Systems Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4016218 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041315 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4083007 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4014056 (Why is no real title available?) | 1986-01-01 | Paper |
