WORST_CASE(?,O(n^2))

Solution:
---------

  "+" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(4, 4)
  "0" :: [] -(0)-> "A"(3, 3)
  "0" :: [] -(0)-> "A"(1, 0)
  "1" :: [] -(0)-> "A"(0, 0)
  "f" :: ["A"(4, 4)] -(2)-> "A"(0, 0)
  "g" :: ["A"(3, 3) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "s" :: ["A"(8, 4)] -(4)-> "A"(4, 4)
  "s" :: ["A"(6, 3)] -(3)-> "A"(3, 3)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(2, 1)] -(1)-> "A"(1, 1)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)


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




Base Constructors:
------------------