WORST_CASE(?,O(n^2))

Solution:
---------

  "a" :: [] -(10)-> "A"(3, 3)
  "activate" :: ["A"(12, 12)] -(12)-> "A"(0, 0)
  "f" :: ["A"(12, 0)] -(8)-> "A"(0, 0)
  "g" :: ["A"(0, 0)] -(1)-> "A"(1, 0)
  "n__a" :: [] -(0)-> "A"(0, 0)
  "n__a" :: [] -(0)-> "A"(12, 12)
  "n__a" :: [] -(0)-> "A"(13, 13)
  "n__f" :: ["A"(0, 0)] -(12)-> "A"(12, 0)
  "n__f" :: ["A"(12, 0)] -(12)-> "A"(12, 12)
  "n__f" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "n__g" :: ["A"(12, 12)] -(12)-> "A"(12, 12)
  "n__g" :: ["A"(0, 0)] -(0)-> "A"(12, 0)
  "n__g" :: ["A"(0, 0)] -(0)-> "A"(9, 0)


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




Base Constructors:
------------------
  "\"n__a\"_A" :: [] -(0)-> "A"(1, 0)
  "\"n__a\"_A" :: [] -(0)-> "A"(0, 1)
  "\"n__f\"_A" :: ["A"(0)] -(1)-> "A"(1, 0)
  "\"n__f\"_A" :: ["A"(0)] -(0)-> "A"(0, 1)
  "\"n__g\"_A" :: ["A"(0)] -(0)-> "A"(1, 0)
  "\"n__g\"_A" :: ["A"(0)] -(1)-> "A"(0, 1)