Register

MadeEasy Test Series: Theory of Computation- Finite Automata

• edited by
583 views
2 votes
2 votes
Q.51

Consider the finite automaton is the following figure.

What is the number of state to accept same language by DFA for above NFA (need not minimum)?

  • 7
  • 9
  • 11
  • 16

I think here minimum state required is 8. So 9 is correct answer !

• edited by
User Avatar

1 Answer

Best answer
5 votes
5 votes

answer is 7

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
prisonmatch asked Jan 6, 2019
1,219 views
MadeEasy Test Series: Theory Of Computation - Finite Automata
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
User Avatar
0 votes
0 votes
2 answers
2
jhaanuj2108 asked Sep 26, 2018
640 views
MadeEasy Test Series: Theory Of Computation - Finite Automata
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
User Avatar
0 votes
0 votes
1 answer
3
jhaanuj2108 asked Sep 26, 2018
697 views
MadeEasy Test Series: Theory Of Computation - Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
User Avatar
Link Copied!