| Publication | Date of Publication | Type |
|---|
Attributed tree transducers for partial functions
| 2025-01-20 | Paper |
Checking in polynomial time whether or not a regular tree language is deterministic top-down
Information Processing Letters | 2024-03-26 | Paper |
Deciding whether an attributed translation can be realized by a top-down transducer
Implementation and Application of Automata | 2024-02-28 | Paper |
Functionality of compositions of top-down tree transducers is decidable
Information and Computation | 2024-01-18 | Paper |
Definability Results for Top-Down Tree Transducers
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
How to decide functionality of compositions of top-down tree transducers
Algebraic Informatics | 2023-07-26 | Paper |
Deciding origin equivalence of weakly self-nesting macro tree transducers
Information Processing Letters | 2023-01-30 | Paper |
Deciding top-down determinism of regular tree languages
| 2022-05-20 | Paper |
Definability results for top-down tree transducers
| 2022-03-25 | Paper |
Equivalence problems for tree transducers: a brief survey
| 2021-06-22 | Paper |
scientific article; zbMATH DE number 7360256 (Why is no real title available?)
| 2021-06-17 | Paper |
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Acta Informatica | 2021-04-28 | Paper |
Largest common prefix of a regular tree language
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Constant delay traversal of grammar-compressed graphs with bounded rank
Information and Computation | 2020-07-13 | Paper |
Static garbage collection
| 2020-05-06 | Paper |
Grammar-based compression of unranked trees
Theory of Computing Systems | 2020-02-27 | Paper |
Largest common prefix of a regular tree language
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Deciding equivalence of separated non-nested attribute systems in polynomial time
| 2020-01-28 | Paper |
Equivalence of deterministic top-down tree-to-string transducers is decidable
Journal of the ACM | 2018-12-06 | Paper |
Grammar-based compression of unranked trees
Lecture Notes in Computer Science | 2018-11-28 | Paper |
Constant-time tree traversal and subtree equality check for grammar-compressed trees
Algorithmica | 2018-07-25 | Paper |
Compression of unordered XML trees
| 2018-07-18 | Paper |
Decision problems of tree transducers with origin
Information and Computation | 2018-06-14 | Paper |
Multiple context-free tree grammars: lexicalization and characterization
Theoretical Computer Science | 2018-05-17 | Paper |
Balancedness of MSO transductions in polynomial time
Information Processing Letters | 2018-03-16 | Paper |
(Re)introducing regular graph languages
| 2017-12-18 | Paper |
Efficient testing and matching of deterministic regular expressions
Journal of Computer and System Sciences | 2017-09-07 | Paper |
A strict border for the decidability of \(E\)-unification for recursive functions
Algebraic and Logic Programming | 2017-01-19 | Paper |
Determinacy and rewriting of functional top-down and MSO tree transformations
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Domains of partial attributed tree transducers
Information Processing Letters | 2016-06-16 | Paper |
XML compression via directed acyclic graphs
Theory of Computing Systems | 2016-04-18 | Paper |
Look-ahead removal for total deterministic top-down tree transducers
Theoretical Computer Science | 2016-01-21 | Paper |
Decision problems of tree transducers with origin
Automata, Languages, and Programming | 2015-11-04 | Paper |
Compressed tree canonization
Automata, Languages, and Programming | 2015-11-04 | Paper |
How to remove the look-ahead of top-down tree transducers
Developments in Language Theory | 2014-10-14 | Paper |
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Type checking of tree walking transducers
Modern Applications of Automata Theory | 2013-02-26 | Paper |
The Complexity of Tree Transducer Output Languages
| 2012-10-19 | Paper |
Earliest normal form and minimization for bottom-up tree transducers
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences | 2012-08-17 | Paper |
First-order unification on compressed terms
| 2012-04-24 | Paper |
Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete
SIAM Journal on Computing | 2011-07-29 | Paper |
Minimization of deterministic bottom-up tree transducers
Developments in Language Theory | 2010-08-31 | Paper |
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters | 2010-01-29 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Deciding equivalence of top-down XML transformations in polynomial time
Journal of Computer and System Sciences | 2009-06-08 | Paper |
Parameter Reduction in Grammar-Compressed Trees
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Multi-Return Macro Tree Transducers
Implementation and Applications of Automata | 2009-02-12 | Paper |
Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science | 2007-01-09 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Database Programming Languages
Lecture Notes in Computer Science | 2006-10-20 | Paper |
scientific article; zbMATH DE number 2087226 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080402 (Why is no real title available?)
| 2004-08-04 | Paper |
A comparison of pebble tree transducers with macro tree transducers
Acta Informatica | 2004-03-11 | Paper |
Macro Tree Translations of Linear Size Increase are MSO Definable
SIAM Journal on Computing | 2003-09-28 | Paper |
scientific article; zbMATH DE number 1954390 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1929941 (Why is no real title available?)
| 2003-06-18 | Paper |
A formal model for an expressive fragment of XSLT
Information Systems | 2003-02-02 | Paper |
Macro tree transducers, attribute grammars, and MSO definable tree translations.
Information and Computation | 2003-01-14 | Paper |
Output string languages of compositions of deterministic macro tree transducers
Journal of Computer and System Sciences | 2002-08-04 | Paper |
scientific article; zbMATH DE number 1696859 (Why is no real title available?)
| 2002-01-28 | Paper |
scientific article; zbMATH DE number 1504824 (Why is no real title available?)
| 2000-11-07 | Paper |
scientific article; zbMATH DE number 1406164 (Why is no real title available?)
| 2000-10-03 | Paper |
scientific article; zbMATH DE number 1500542 (Why is no real title available?)
| 2000-09-04 | Paper |
The generating power of total deterministic tree transducers
Information and Computation | 1999-12-19 | Paper |
Cooperating distributed hyperedge replacement grammars
Grammars | 1999-11-10 | Paper |
scientific article; zbMATH DE number 1332642 (Why is no real title available?)
| 1999-09-09 | Paper |
scientific article; zbMATH DE number 1330139 (Why is no real title available?)
| 1999-09-01 | Paper |
scientific article; zbMATH DE number 1268708 (Why is no real title available?)
| 1999-03-22 | Paper |
