WORST_CASE(?,O(n^1))

Solution:
---------

  "*" :: ["A"(0) x "A"(0)] -(0)-> "A"(2)
  "*" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "+" :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
  "+" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(7)
  "0" :: [] -(0)-> "A"(0)
  "0" :: [] -(0)-> "A"(14)
  "0" :: [] -(0)-> "A"(12)
  "0" :: [] -(0)-> "A"(15)
  "f" :: ["A"(7)] -(3)-> "A"(0)
  "s" :: ["A"(0)] -(7)-> "A"(7)
  "s" :: ["A"(0)] -(1)-> "A"(1)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(0)] -(4)-> "A"(4)


Cost Free Signatures:
---------------------




Base Constructors:
------------------
  "\"*\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"+\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(0)] -(1)-> "A"(1)