A general framework to build contextual cover set
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Expander2: Program Verification Between Interaction and Automation
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Methods in Software and Systems Modeling
| Hi-index | 0.00 |