1,311 views
0 votes
0 votes
The number of states in the minimal deterministic finite automata corresponding to the regular expression (0 + 1)* (000 + 001) is ________.

2 Answers

0 votes
0 votes

correct me if i am wrong

0 votes
0 votes

better way should be by making NFA first

Related questions

0 votes
0 votes
1 answer
1
Abhishek3301 asked Feb 6
10 views
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4
jugnu1337 asked Sep 3, 2023
345 views
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to