0 votes 0 votes What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ? Theory of Computation theory-of-computation finite-automata number-of-dfa + – dutta18 asked Sep 21, 2022 retagged Sep 21, 2022 by makhdoom ghaya dutta18 415 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Idea: To create (a*ba)* we need a self loop of the form “a*ba” which can be created using the following NFA. Sumit Singh Dhami answered Sep 21, 2022 Sumit Singh Dhami comment Share Follow See all 2 Comments See all 2 2 Comments reply dutta18 commented Sep 21, 2022 reply Follow Share I have tried somewhat like this using €-NFA. Is it correct ? 0 votes 0 votes Sumit Singh Dhami commented Sep 21, 2022 reply Follow Share Yes it is correct. 0 votes 0 votes Please log in or register to add a comment.