Register

NFA/DFA

622 views

1 Answer

Best answer
3 3 votes

Here it is important to identify the language. 

As

I) is generating $(a+b)^*$ 

II) is generating $a(a+b)^*$ 

III) is generating $a^mb^n, \; m\geq n$. 

• selected by
Voting & Accepting an answer helps improve the community
← Previous · Memory Access TimeNext → · Probability of Succe...
← Previous in category · Is |L1. L2| = |L1| x...Next in category → · MadeEasy Test Series...
Position:
Show:

Related questions

3 3 votes
2 2 answers
235
235 views
GO Classes asked Jul 10
235 views
GO Classes DPP | GATE CS | Theory of Computation | DFA-NFA Equivalence
Which of the following is true?A language $L$ is accepted by DFA iff it is accepted by some $\epsilon$-NFA. A language $L$ is accepted by $\epsilon$-NFA iff it is accepte...
5 5 votes
4 4 answers
307
307 views
GO Classes asked Jul 8
307 views
GO Classes DPP | GATE CS | Theory of Computation | NFA to DFA
Which of the following statements are correct?There is a $2^k$-state DFA for every $k$-state NFA. There is a $k$-state DFA for every $2^k$-state NFA. There is a $k$-state...
0 0 votes
1 1 answer
267
267 views
mohamed_bahgat asked Jun 3, 2025
267 views
Given Language: L = { a b ∪ a b a } ∗ L={ab∪aba} ∗ Problem Statement: If X X is the minimum number of states required for a DFA to accept L L, and Y Y is the number of states required for an NFA to accept L L, then what is ∣ X − Y ∣ ∣X−Y∣? Multiple Choice Answers: a) 1 b) 2 c) 3 d) 4
0 0 votes
1 answers 1 answer
721
721 views
Souvik33 asked Nov 7, 2022
721 views
Theory Of Computation (NFA/DFA)
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110