On tree automata that certify termination of left-linear term rewriting systems

[1]  Nachum Dershowitz.  Termination of Linear Rewriting Systems (Preliminary Version) , 1981, ICALP.

[2]  Nachum Dershowitz,et al.  Abstract Termination of Linear Rewriting Systems* -preliminary Version , 1981 .

[3]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[4]  Jürgen Giesl.  Automated Termination Proofs with Measure Functions , 1995, KI.

[5]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[6]  Bala Ravikumar.  Peg-Solitaire, String Rewriting Systems and Finite Automata , 1997, ISAAC.

[7]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[8]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[9]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[10]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[11]  Yoshihito Toyama,et al.  Decidability for Left-Linaer Growing Term Rewriting Systems , 1999, RTA.

[12]  Takashi Nagaya,et al.  Decidability for Left-Linear Growing Term Rewriting Systems , 1998, Inf. Comput..

[13]  Aart Middeldorp,et al.  Approximations for Strategies and Termination , 2002, WRS.

[14]  Claude Marché,et al.  Proving Termination of Rewriting with C i ME , 2003 .

[15]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[16]  R. C. de Vrijer,et al.  Equivalence of reduction , 2003 .

[17]  Nao Hirokawa,et al.  Tsukuba Termination Tool , 2003, RTA.

[18]  Dieter Hofbauer,et al.  Match-Bounded String Rewriting Systems , 2003, MFCS.

[19]  Dieter Hofbauer,et al.  Deleting String Rewriting Systems Preserve Regularity , 2003, Developments in Language Theory.

[20]  Jürgen Giesl,et al.  Automated Termination Proofs with AProVE , 2004, RTA.

[21]  Hans Zantema,et al.  Finding Finite Automata That Certify Termination of String Rewriting , 2004, CIAA.

[22]  Hans Zantema,et al.  Tree automata that certify termination of term rewriting systems , 2004 .

[23]  Johannes Waldmann.  Matchbox: A Tool for Match-Bounded String Rewriting , 2004, RTA.

[24]  Hans Zantema.  TORPA: Termination of Rewriting Proved Automatically , 2004, RTA.

[25]  Dieter Hofbauer,et al.  Match-Bounded String Rewriting Systems , 2003, Applicable Algebra in Engineering, Communication and Computing.

[26]  Valérie Viet Triem Tong,et al.  Reachability Analysis over Term Rewriting Systems , 2004, Journal of Automated Reasoning.

[27]  Hans Zantema,et al.  Finding finite automata that certify termination of string rewriting systems , 2005, Int. J. Found. Comput. Sci..

[28]  Nao Hirokawa,et al.  Tyrolean Termination Tool , 2005, RTA.

[29]  Hans Zantema,et al.  On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems , 2005, RTA.

[30]  Hans Zantema.  Termination of String Rewriting Proved Automatically , 2005, Journal of Automated Reasoning.