Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A New Result about the Decidability of the Existential One-Step Rewriting Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Weakly Regular Relations and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Solvability of Context Equations with Two Context Variables is Decidable
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Confluence of right ground term rewriting systems is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |