Add an algorithm to transform Fin-less CNF acceptance into TGBA

Assume you have an automaton with Fin-less acceptance.

• put the acceptance in CNF form: A1 & A2 & ... & An where each Ai has the form (Inf(i1)|Inf(i2)|...)
• introduce one acceptance set Si per Ai, where Si is the union of i1, i2, ...
• set the new acceptance to Inf(S1)&Inf(S2)&...&Inf(Sn).