On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Term rewriting restricted to ground terms
Theoretical Computer Science
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Theoretical Computer Science
Information Processing Letters
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Tree automata for rewrite strategies
Journal of Symbolic Computation
On s-regular preffix-rewriting systems and automatic structures
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Hi-index | 5.23 |