| Publication | Date of Publication | Type |
|---|
Confluence by critical pair analysis revisited
(available as arXiv preprint) | 2020-03-10 | Paper |
| Confluence by critical pair analysis revisited | 2020-03-10 | Paper |
Conditions for confluence of innermost terminating term rewriting systems
Applicable Algebra in Engineering, Communication and Computing | 2019-08-27 | Paper |
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters | 2010-01-18 | Paper |
Rewriting Techniques and Applications
Lecture Notes in Computer Science | 2009-04-30 | Paper |
The Confluence Problem for Flat TRSs
Artificial Intelligence and Symbolic Computation | 2009-01-15 | Paper |
The unification problem for confluent right-ground term rewriting systems.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1722710 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1398069 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398094 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1380902 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1380901 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1322309 (Why is no real title available?) | 1999-11-02 | Paper |
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
SIAM Journal on Computing | 1993-05-16 | Paper |
The equivalence problem for real-time DPDAs
Journal of the ACM | 1987-01-01 | Paper |
The Church-Rosser property for ground term-rewriting systems is decidable
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4043235 (Why is no real title available?) | 1986-01-01 | Paper |
On the data type extension problem for algebraic specifications
Theoretical Computer Science | 1985-01-01 | Paper |
Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
Theoretical Computer Science | 1984-01-01 | Paper |
Some remarks on subclass containment problems for several classes of dpda's
Information Processing Letters | 1984-01-01 | Paper |
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
Journal of Computer and System Sciences | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3692652 (Why is no real title available?) | 1980-01-01 | Paper |
The equivalence problem for real-time strict deterministic languages
Information and Control | 1980-01-01 | Paper |
A real-time strictness test for deterministic pushdown automata
Information and Control | 1980-01-01 | Paper |
A simplicity test for deterministic pushdown automata
Information and Control | 1980-01-01 | Paper |
The decidability of equivalence for deterministic stateless pushdown automata
Information and Control | 1978-01-01 | Paper |
