Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Linear Shallow Term Rewrite Systems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
Term rewriting restricted to ground terms
Theoretical Computer Science
Note: on ground tree transformations and congruences induced by tree automata
Theoretical Computer Science
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
A new decidability technique for ground term rewriting systems with applications
ACM Transactions on Computational Logic (TOCL)
Decidable call-by-need computations in term rewriting
Information and Computation
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
Decidable call-by-need computations in term rewriting
Information and Computation
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Levels of undecidability in rewriting
Information and Computation
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
The Ground Tree Transducer Game
Fundamenta Informaticae
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |