280 views
1 votes
1 votes
Convert regular expression to dfa

(i) (ab*)*

(ii) (a+ab)*(a+^)

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
hashir inayat asked Jul 20, 2017
790 views
Build an DFA that accepts a and b as an input and contain words that does not begin and end with double letters.
0 votes
0 votes
0 answers
2
zshaikh asked May 10, 2023
213 views
For the following regular expression:a+|(ab)+Over the alphabet:{a,b}Give an epsilon-NFA that recognizes the same language.
4 votes
4 votes
0 answers
4
Bikram asked Aug 12, 2017
607 views
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is...