WORST_CASE(?,O(n^1))

Solution:
---------

  "ackin" :: ["A"(0) x "A"(2)] -(0)-> "A"(2)
  "ackout" :: ["A"(2)] -(2)-> "A"(2)
  "s" :: ["A"(0)] -(0)-> "A"(0)
  "s" :: ["A"(2)] -(2)-> "A"(2)
  "u21" :: ["A"(2) x "A"(0)] -(1)-> "A"(2)
  "u22" :: ["A"(2)] -(2)-> "A"(2)


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




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