WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(8, 8)
  "0" :: [] -(0)-> "A"(6, 14)
  "0" :: [] -(0)-> "A"(12, 12)
  "a__tail" :: ["A"(4, 8)] -(5)-> "A"(4, 8)
  "a__zeros" :: [] -(6)-> "A"(4, 9)
  "cons" :: ["A"(4, 8) x "A"(8, 8)] -(4)-> "A"(4, 8)
  "cons" :: ["A"(8, 8) x "A"(8, 8)] -(8)-> "A"(8, 8)
  "cons" :: ["A"(4, 9) x "A"(9, 9)] -(4)-> "A"(4, 9)
  "mark" :: ["A"(8, 8)] -(8)-> "A"(4, 8)
  "tail" :: ["A"(8, 8)] -(8)-> "A"(8, 8)
  "tail" :: ["A"(4, 8)] -(4)-> "A"(4, 8)
  "zeros" :: [] -(0)-> "A"(8, 8)
  "zeros" :: [] -(0)-> "A"(12, 11)
  "zeros" :: [] -(0)-> "A"(14, 14)


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




Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"cons\"_A" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(0, 1) x "A"(1, 1)] -(0)-> "A"(0, 1)
  "\"tail\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"tail\"_A" :: ["A"(0, 1)] -(0)-> "A"(0, 1)
  "\"zeros\"_A" :: [] -(0)-> "A"(1, 0)
  "\"zeros\"_A" :: [] -(0)-> "A"(0, 1)