We consider the system AotoYamada_05__025.

  Alphabet:

    apply : [a -> b * a] --> b 

  Rules:

    apply(f, x) => f x 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).

Symbol apply is an encoding for application that is only used in innocuous ways.  We can simplify the program (without losing non-termination) by removing it.  This gives:

  Alphabet:


  Rules: