WORST_CASE(?,O(n^1))

Solution:
---------

  "E" :: [] -(0)-> "bstring"(1)
  "E" :: [] -(0)-> "bstring"(0)
  "O" :: ["bstring"(1)] -(1)-> "bstring"(1)
  "O" :: ["bstring"(0)] -(0)-> "bstring"(0)
  "Z" :: ["bstring"(1)] -(1)-> "bstring"(1)
  "Z" :: ["bstring"(0)] -(0)-> "bstring"(0)
  "flip#1" :: ["bstring"(1)] -(1)-> "bstring"(0)
  "main" :: ["bstring"(1)] -(2)-> "bstring"(0)


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



Used heuristics (no base constructurs)
--------------------------------------


Parsed Typed Term Rewrite System:
---------------------------------

(STRATEGY
 INNERMOST)
(VAR
 "v4" "v0")
(DATATYPES
   "bstring" = µX.< "E", "Z"(X), "O"(X) >)
(SIGNATURES
   "flip#1" :: ["bstring"] --> "bstring"
   "main" :: ["bstring"] --> "bstring")
(RULES
 "flip#1"("E"()) -> "E"()
 "flip#1"("Z"("v4")) -> "O"("flip#1"("v4"))
 "flip#1"("O"("v4")) -> "Z"("flip#1"("v4"))
 "main"("v0") -> "flip#1"("v0"))


WORST_CASE(?,O(n^1))