search
Log In
0 votes
261 views

in Theory of Computation 261 views
0
What is the transition symbol from A to B ?
0
Epsilon

4 Answers

1 vote

 

C is the correct 

1 vote
Answer is B

We can eliminate A as this e-NFA accepts 10

We can eliminate C as Epselon is not in this language which is accepted by above e-NFA

Since Strings generated by language B are {e,0,1,00,01,10,11....}, which contains all strings accepted by e-NFA machine mentioned above.

Question is about what is the actual language accepted by e-NFA aove.

Not like which of these languages accepted by NFA.
0 votes

Wrong Options

according to me in place of none of these 

All of these will be there

then all of these option will be correct

0 votes
I think answer is none of these as this automata accepts all strings starting with zero which is not represented by any RE here

Related questions

0 votes
1 answer
1
72 views asked Jun 6, 2019 in Theory of Computation Deepalitrapti 72 views
0 votes
1 answer
2
0 votes
1 answer
3
150 views asked May 12, 2019 in Theory of Computation Alakhator 150 views
1 vote
1 answer
4
141 views
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) = L(D) i.e language represented by DFA is equal to language represented by NFA?
asked Feb 20, 2019 in Theory of Computation Bhaskar Singh 141 views
...