| Publication | Date of Publication | Type |
|---|
Deciding the NTS property of context-free grammars
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Domino treewidth
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Acta Informatica | 2021-04-28 | Paper |
Computability by monadic second-order logic
Information Processing Letters | 2021-03-11 | Paper |
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
(available as arXiv preprint) | 2021-01-05 | Paper |
| A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage | 2021-01-05 | Paper |
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
Theoretical Computer Science | 2020-12-16 | Paper |
A Greibach normal form for context-free graph grammars
Automata, Languages and Programming | 2019-12-04 | Paper |
Corrigendum to: ``Iterated stack automata and complexity classes''
Information and Computation | 2019-05-29 | Paper |
Concatenation of graphs
Lecture Notes in Computer Science | 2019-01-10 | Paper |
Multiple context-free tree grammars: lexicalization and characterization
Theoretical Computer Science | 2018-05-17 | Paper |
| Multiple context-free tree grammars and multi-component tree adjoining grammars | 2017-11-22 | Paper |
Composition closure of linear extended top-down tree transducers
Theory of Computing Systems | 2017-03-31 | Paper |
Determinacy and rewriting of functional top-down and MSO tree transformations
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Context-free tree grammars are as powerful as context-free jungle grammars
Acta Cybernetica | 2016-05-03 | Paper |
Erratum to: ``Top-down tree transducers with regular look-ahead''
Theory of Computing Systems | 2016-03-09 | Paper |
Look-ahead removal for total deterministic top-down tree transducers
Theoretical Computer Science | 2016-01-21 | Paper |
The generative power of delegation networks
Information and Computation | 2015-12-07 | Paper |
Two-way pebble transducers for partial functions and their composition
Acta Informatica | 2015-10-29 | Paper |
How to remove the look-ahead of top-down tree transducers
Developments in Language Theory | 2014-10-14 | Paper |
Tree transducers, L systems and two-way machines (extended abstract)
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Graph structure and monadic second-order logic. A language-theoretic approach | 2011-02-18 | Paper |
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters | 2010-01-29 | Paper |
An exercise in structural congruence
Information Processing Letters | 2010-01-29 | Paper |
A Kleene characterization of computability
Information Processing Letters | 2010-01-29 | Paper |
Extended multi bottom-up tree transducers
Acta Informatica | 2009-11-18 | Paper |
Deciding equivalence of top-down XML transformations in polynomial time
Journal of Computer and System Sciences | 2009-06-08 | Paper |
The time complexity of typechecking tree-walking tree transducers
Acta Informatica | 2009-04-27 | Paper |
Extended Multi Bottom-Up Tree Transducers
Developments in Language Theory | 2008-10-30 | Paper |
| scientific article; zbMATH DE number 5286862 (Why is no real title available?) | 2008-06-11 | Paper |
Nested Pebbles and Transitive Closure
STACS 2006 | 2008-03-19 | Paper |
| Finitary compositions of two-way finite-state transductions | 2008-01-02 | Paper |
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Logical Methods in Computer Science | 2007-10-11 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Clique-width for 4-vertex forbidden subgraphs
Theory of Computing Systems | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 2150277 (Why is no real title available?) | 2005-03-30 | Paper |
A new natural structural congruence in the pi-calculus with replication
Acta Informatica | 2004-12-13 | Paper |
| scientific article; zbMATH DE number 2087226 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087487 (Why is no real title available?) | 2004-08-11 | Paper |
Branching synchronization grammars with nested tables
Journal of Computer and System Sciences | 2004-08-10 | Paper |
A comparison of pebble tree transducers with macro tree transducers
Acta Informatica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2040912 (Why is no real title available?) | 2004-02-11 | Paper |
Macro Tree Translations of Linear Size Increase are MSO Definable
SIAM Journal on Computing | 2003-09-28 | Paper |
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1929941 (Why is no real title available?) | 2003-06-18 | Paper |
Derivation trees of ground term rewriting systems.
Information and Computation | 2003-01-14 | Paper |
Macro tree transducers, attribute grammars, and MSO definable tree translations.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1809721 (Why is no real title available?) | 2002-12-10 | Paper |
Decidability of the finiteness of ranges of tree transductions
Information and Computation | 2002-11-24 | Paper |
The equivalence of bottom-up and top-down tree-to-graph transducers
Journal of Computer and System Sciences | 2002-11-24 | Paper |
Output string languages of compositions of deterministic macro tree transducers
Journal of Computer and System Sciences | 2002-08-04 | Paper |
Structural inclusion in the pi-calculus with replication
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1504824 (Why is no real title available?) | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1405653 (Why is no real title available?) | 2000-10-17 | Paper |
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences | 2000-10-10 | Paper |
| scientific article; zbMATH DE number 1500542 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1456950 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1408335 (Why is no real title available?) | 2000-02-29 | Paper |
| scientific article; zbMATH DE number 1354852 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1302042 (Why is no real title available?) | 1999-06-16 | Paper |
Axioms for generalized graphs, illustrated by a Cantor-Bernstein proposition
Acta Informatica | 1999-04-26 | Paper |
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science | 1999-01-12 | Paper |
Context-free graph grammars and concatenation of graphs
Acta Informatica | 1998-10-01 | Paper |
Logical description of context-free graph languages
Journal of Computer and System Sciences | 1998-08-04 | Paper |
| scientific article; zbMATH DE number 1149450 (Why is no real title available?) | 1998-05-13 | Paper |
| scientific article; zbMATH DE number 1086493 (Why is no real title available?) | 1997-11-13 | Paper |
| scientific article; zbMATH DE number 1004367 (Why is no real title available?) | 1997-11-09 | Paper |
Domino Treewidth
Journal of Algorithms | 1997-08-25 | Paper |
Regular description of context-free graph languages
Journal of Computer and System Sciences | 1997-03-18 | Paper |
Characterization and complexity of uniformly nonprimitive labeled 2-structures
Theoretical Computer Science | 1997-02-28 | Paper |
A multiset semantics for the pi-calculus with replication
Theoretical Computer Science | 1997-02-28 | Paper |
Finite languages for the representation of finite graphs
Journal of Computer and System Sciences | 1996-07-16 | Paper |
| scientific article; zbMATH DE number 809155 (Why is no real title available?) | 1995-11-30 | Paper |
| scientific article; zbMATH DE number 762057 (Why is no real title available?) | 1995-06-08 | Paper |
The translation power of top-down tree-to-graph transducers
Journal of Computer and System Sciences | 1994-12-04 | Paper |
Context-free graph languages of bounded degree are generated by apex graph grammars
Acta Informatica | 1994-11-23 | Paper |
Hypergraph languages of bounded degree
Journal of Computer and System Sciences | 1994-03-27 | Paper |
\(X\)-automata on \(\omega\)-words
Theoretical Computer Science | 1993-08-30 | Paper |
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177419 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177438 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177441 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177442 (Why is no real title available?) | 1993-05-18 | Paper |
An elementary proof of double Greibach normal form
Information Processing Letters | 1993-05-16 | Paper |
Context-free hypergraph grammars have the same term-generating power as attribute grammars
Acta Informatica | 1993-01-16 | Paper |
Iterated stack automata and complexity classes
Information and Computation | 1992-06-28 | Paper |
A regular characterization of graph languages definable in monadic second-order logic
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17539 (Why is no real title available?) | 1992-06-26 | Paper |
Branching processes of Petri nets
Acta Informatica | 1992-06-25 | Paper |
The string generating power of context-free hypergraph grammars
Journal of Computer and System Sciences | 1992-06-25 | Paper |
The power of two-way deterministic checking stack automata
Information and Computation | 1992-06-25 | Paper |
Nonterminal separation in graph grammars
Theoretical Computer Science | 1991-01-01 | Paper |
Modular tree transducers
Theoretical Computer Science | 1991-01-01 | Paper |
Attribute storage optimization by stacks
Acta Informatica | 1990-01-01 | Paper |
Complexity of boundary graph languages
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
The complexity of regular DNLC graph languages
Journal of Computer and System Sciences | 1990-01-01 | Paper |
Boundary graph grammars with dynamic edge relabeling
Journal of Computer and System Sciences | 1990-01-01 | Paper |
A comparison of boundary graph grammars and context-free hypergraph grammars
Information and Computation | 1990-01-01 | Paper |
Linear graph grammars: Power and complexity
Information and Computation | 1989-01-01 | Paper |
