Searching for "On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On tree automata that certify termination of left-linear term rewriting systems
by Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema, Faculteit Wiskunde En Informatica — 2005 — In Proceedings of the 16th International Conference on Rewriting Techniques and Applications
…On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems Alfons Geser 1…
Cited by 6 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB