| Publication | Date of Publication | Type |
|---|
Decidable approximations of term rewriting systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| Symbolic weighted language models, quantitative parsing and automated music transcription | 2022-08-16 | Paper |
Weighted automata computation of edit distances with consolidations and fragmentations
Information and Computation | 2022-01-06 | Paper |
A parse-based framework for coupled rhythm quantization and score structuring
Mathematics and Computation in Music | 2019-10-17 | Paper |
One-variable context-free hedge automata
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Pumping, cleaning and symbolic constraints solving
Automata, Languages and Programming | 2019-04-29 | Paper |
\(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems
Logical Methods in Computer Science | 2016-04-28 | Paper |
Term rewriting with prefix context constraints and bottom-up strategies
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
A structural theory of rhythm notation based on tree representations and term rewriting
Mathematics and Computation in Music | 2015-08-20 | Paper |
RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Closure of tree automata languages under innermost rewriting
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
Decidable classes of tree automata mixing local and global constraints modulo flat theories
Logical Methods in Computer Science | 2013-06-20 | Paper |
Rewrite Closure and CF Hedge Automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Sufficient completeness verification for conditional and constrained TRS
Journal of Applied Logic | 2012-05-23 | Paper |
Controlled term rewriting
Frontiers of Combining Systems | 2011-10-07 | Paper |
Rigid tree automata and applications
Information and Computation | 2011-07-27 | Paper |
Unique Normalization for Shallow TRS
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters | 2009-04-28 | Paper |
Rigid Tree Automata
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Tree Automata with Equality Constraints Modulo Equational Theories
Automated Reasoning | 2009-03-12 | Paper |
The Confluence Problem for Flat TRSs
Artificial Intelligence and Symbolic Computation | 2009-01-15 | Paper |
Automated Induction with Constrained Tree Automata
Automated Reasoning | 2008-11-27 | Paper |
Closure of Hedge-Automata Languages by Hedge Rewriting
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Visibly Tree Automata with Memory and Constraints
Logical Methods in Computer Science | 2008-08-07 | Paper |
Tree automata with equality constraints modulo equational theories
The Journal of Logic and Algebraic Programming | 2008-04-22 | Paper |
Tree Automata with Memory, Visibility and Structural Constraints
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
Journal of Automated Reasoning | 2007-01-30 | Paper |
Ground reducibility is EXPTIME-complete
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 1696763 (Why is no real title available?) | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1414314 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1405649 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1302628 (Why is no real title available?) | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1189060 (Why is no real title available?) | 1998-08-13 | Paper |
