The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Predicate Logic and Tree Automata with Tests
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
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
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Set constraints with projections
Journal of the ACM (JACM)
| Hi-index | 0.00 |