WORST_CASE(?,O(n^2)) Solution: --------- "c" :: ["A"(15, 15)] -(15)-> "A"(0, 15) "c" :: ["A"(0, 0)] -(0)-> "A"(0, 0) "f" :: ["A"(14, 0) x "A"(0, 15)] -(5)-> "A"(6, 14) "s" :: ["A"(14, 0)] -(14)-> "A"(14, 0) "s" :: ["A"(0, 0)] -(0)-> "A"(0, 15) "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0) Cost Free Signatures: --------------------- Base Constructors: ------------------ "\"c\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0) "\"c\"_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1) "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0) "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)