0 votes 0 votes Design an nfa with no more than five states for the set $\left \{ abab^n: n >0 \right \} \cup \left \{ ab{a}^n : n\geq 0 \right \}$ Theory of Computation peter-linz theory-of-computation peter-linz-edition5 finite-automata + – ankit-saha asked Mar 19, 2022 • edited Jan 11, 2023 by Deepak Poonia ankit-saha 398 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kabir5454 commented Mar 19, 2022 i edited by Kabir5454 Mar 19, 2022 reply Follow Share $b′′ --> b^{n} ?$ if yes the please refer to the same question already answerd. https://gateoverflow.in/57709/Ugcnet-dec2012-iii-47 3 votes 3 votes ankit-saha commented Mar 19, 2022 reply Follow Share Yes, this is it. Thank you. 0 votes 0 votes Please log in or register to add a comment.
