1 votes 1 votes Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$ Theory of Computation theory-of-computation minimal-state-automata + – Prabhanjan_1 asked Dec 26, 2016 Prabhanjan_1 503 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Habibkhan commented Dec 26, 2016 reply Follow Share Same here...As I m not getting any standard language here..So that way it needs to be done.. 0 votes 0 votes Prabhanjan_1 commented Dec 26, 2016 reply Follow Share Ok... 0 votes 0 votes atul_21 commented Dec 1, 2017 reply Follow Share Can you show how did u come to 5 states in NFA ?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes min. states in DFA = 11 tech_beardo answered Aug 18, 2020 tech_beardo comment Share Follow See all 0 reply Please log in or register to add a comment.