WORST_CASE(?,O(n^2))

Solution:
---------

  "a" :: [] -(0)-> "A"(14, 0)
  "a" :: [] -(0)-> "A"(3, 11)
  "a" :: [] -(0)-> "A"(14, 14)
  "a" :: [] -(0)-> "A"(8, 14)
  "a__f" :: ["A"(14, 0)] -(11)-> "A"(0, 0)
  "f" :: ["A"(14, 0)] -(14)-> "A"(14, 0)
  "f" :: ["A"(14, 11)] -(3)-> "A"(3, 11)
  "f" :: ["A"(10, 9)] -(1)-> "A"(1, 9)
  "f" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "g" :: ["A"(11, 11)] -(11)-> "A"(3, 11)
  "g" :: ["A"(1, 1)] -(1)-> "A"(15, 1)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "mark" :: ["A"(3, 11)] -(9)-> "A"(0, 0)


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




Base Constructors:
------------------
  "\"a\"_A" :: [] -(0)-> "A"(1, 0)
  "\"a\"_A" :: [] -(0)-> "A"(0, 1)
  "\"f\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"f\"_A" :: ["A"(1, 1)] -(0)-> "A"(0, 1)
  "\"g\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"g\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1)