WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(1, 0)
  "1" :: [] -(0)-> "A"(1, 0)
  "c" :: ["A"(13, 9)] -(9)-> "A"(4, 9)
  "c" :: ["A"(8, 0)] -(0)-> "A"(8, 0)
  "f" :: ["A"(1, 0)] -(1)-> "A"(3, 2)
  "false" :: [] -(0)-> "A"(1, 0)
  "false" :: [] -(0)-> "A"(13, 12)
  "g" :: ["A"(5, 1) x "A"(4, 9)] -(2)-> "A"(4, 9)
  "if" :: ["A"(1, 0) x "A"(4, 9) x "A"(4, 13)] -(1)-> "A"(4, 9)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(5, 0)] -(5)-> "A"(5, 1)
  "s" :: ["A"(4, 0)] -(4)-> "A"(4, 9)
  "s" :: ["A"(4, 0)] -(4)-> "A"(4, 13)
  "s" :: ["A"(5, 0)] -(5)-> "A"(5, 5)
  "true" :: [] -(0)-> "A"(1, 0)
  "true" :: [] -(0)-> "A"(13, 13)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"1\"_A" :: [] -(0)-> "A"(1, 0)
  "\"1\"_A" :: [] -(0)-> "A"(0, 1)
  "\"c\"_A" :: ["A"(1, 0)] -(0)-> "A"(1, 0)
  "\"c\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1)
  "\"false\"_A" :: [] -(0)-> "A"(1, 0)
  "\"false\"_A" :: [] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)
  "\"true\"_A" :: [] -(0)-> "A"(1, 0)
  "\"true\"_A" :: [] -(0)-> "A"(0, 1)