Register

Gate Academy

• edited by
389 views
0 votes
0 votes

Regular Expression of the NFA :

A.  2*(0+12*)*

B.  2*(0+2*)1*

C.  2*(0+ 12*)

D.  2*(01+12)*

• edited by
User Avatar

1 Answer

Best answer
1 votes
1 votes
A.  2*(0+12*)* ->generate string 0*(000) which could not be accepted by given machine....False

B.  2*(0+2*)1* -> generate string 111 which could not be accepted...False

C.  2*(0+ 12*) ->string 11(generated by NFA)the  could not be generated by this RE.... False

D.  2*(01+12)* ->string 11(generated by NFA)the  could not be generated by this RE.... False
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
1
Hirak asked May 22, 2019
2,371 views
ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ?(a) 4 (b) 16 (c) 20 ...
User Avatar
2 votes
2 votes
0 answers
2
h4kr asked Nov 20, 2022
328 views
gate academy
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true.
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack...
User Avatar
0 votes
0 votes
0 answers
3
Saikat Dutta asked Nov 15, 2017
240 views
Gate Academy
User Avatar
Link Copied!