YES

Consider the TRS R consisting of the following rewrite rules:

	f(x,g(x)) -> x
	f(x,h(y)) -> f(h(x),y)

The TRS R is transformed (by dropping rewrite rules whose left-hand
sides contain a function symbol which does not occur in any right-hand
side) into a TRS R' consisting of the following rewrite rule:

	f(x,h(y)) -> f(h(x),y)

The TRS R is terminating because R' is match-bounded for
RFC#(R') by 0.
A tree automaton compatible with match(R') and RFC#(R') has
	- 3 states (1,...,3)
	- 1 final state (1)
	- 4 transitions:
		#_0 -> 2
		f_0(3,2) -> 1
		h_0(3) -> 3
		h_0(2) -> 3
		


__________________________________________________________________
TTTbox (0.004 seconds) - April 13, 2007
Source file - /home/ami/mkorp/Testbench/tpdb-3.2/TRS/SK90/2.55.trs