WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(1, 0)
  "L" :: ["A"(7, 6)] -(6)-> "A"(1, 6)
  "L" :: ["A"(1, 0)] -(0)-> "A"(1, 0)
  "L" :: ["A"(7, 0)] -(0)-> "A"(7, 0)
  "N" :: ["A"(1, 0) x "A"(7, 0)] -(1)-> "A"(1, 6)
  "N" :: ["A"(7, 0) x "A"(7, 0)] -(7)-> "A"(7, 0)
  "max" :: ["A"(1, 6)] -(0)-> "A"(7, 0)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(7, 0)] -(7)-> "A"(7, 0)
  "s" :: ["A"(7, 0)] -(7)-> "A"(7, 1)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"L\"_A" :: ["A"(1, 0)] -(0)-> "A"(1, 0)
  "\"L\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1)
  "\"N\"_A" :: ["A"(1, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"N\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)