0 votes 0 votes can we solve it with a minimum of 4 states? Theory of Computation theory-of-computation finite-automata number-of-states + – Dknights asked Nov 19, 2022 Dknights 326 views answer comment Share Follow See 1 comment See all 1 1 comment reply Chandrabhan Vishwa 1 commented Nov 19, 2022 reply Follow Share i think yes this episilon NFA regular expression is a(ba)*b which is accepted by the 4 state DFA 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes 4 abhinowKatore answered Nov 19, 2022 • selected Nov 20, 2022 by Dknights abhinowKatore comment Share Follow See all 0 reply Please log in or register to add a comment.