MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
The number of elements present in the e-closure(f..
1.
The number of elements present in the e-closure(f2) in the given diagram:
A.
0
B.
1
C.
2
D.
3
Answer» D. 3
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Remove all the epsilon transitions in the given diagram and compute the number of a-transitions in the result?
Which of the steps are non useful while eliminating the e-transitions for the given diagram?a) Make a as accepting state of N’ if ECLOSE(p) contains an accepting state of Nb) Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(
The number of elements present in the e-closure(f2) in the given diagram:
Which of the following belongs to the epsilon closure set of a?
Design a NFA for the language:L: {an| n is even or divisible by 3}Which of the following methods can be used to simulate the same.a) e-NFAb) Power Construction Methodc) Both (
The number of final states we need as per the given language?Language L: {an| n is even or divisible by 3}
Which of the following does not belong to input alphabet if S={a, b}* for any language?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply