0.00/0.10 MAYBE 0.00/0.10 We consider the system theBenchmark. 0.00/0.10 0.00/0.10 Alphabet: 0.00/0.10 0.00/0.10 0 : [] --> nat 0.00/0.10 1 : [] --> nat 0.00/0.10 f : [nat * nat -> nat] --> nat 0.00/0.10 0.00/0.10 Rules: 0.00/0.10 0.00/0.10 f(0, g) => g f(g 1, g) 0.00/0.10 0.00/0.10 This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). 0.00/0.10 0.00/0.10 EOF