Consider the following NFA:
(i) Build a DFA with as few states as possible that accepts exactly the same language as the NFA above.
(ii) Build a TG (transition graph) with 2 states that accepts exactly the same language as the NFA above.
Correct me if I'm wrong; below is my answer.
My answer is inspired by the answer to my previous question here. I'm not sure if this is correct and will be grateful for your input.
Than you.