1 votes 1 votes Consider the following generalized transition graph. (a) Find an equivalent generalized transition graph with only two states. (b) What is the language accepted by this graph? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression regular-language + – Naveen Kumar 3 asked Apr 2, 2019 Naveen Kumar 3 737 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.