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 N(b) Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(a) to f1(c) Delete all arcs labelled as e(d) None of the mentionedI had been asked this question during an internship interview.The question is from Epsilon Closures topic in division Finite Automata of Automata Theory

Which of the steps are non useful while eliminating the e-transitions

1.	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 N(b) Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(a) to f1(c) Delete all arcs labelled as e(d) None of the mentionedI had been asked this question during an internship interview.The question is from Epsilon Closures topic in division Finite Automata of Automata Theory
Answer» CORRECT choice is (d) None of the mentioned To elaborate: The given are the steps followed while eliminating epsilon TRANSITIONS from a NFA or converting an e-NFA to just NFA.

Discussion

No Comment Found

Related InterviewSolutions

Reverse of a DFA can be formed by(a) using PDA(b) making final state as non-final(c) making final as starting state and starting state as final state(d) None of the mentionedI got this question in an interview for job.This key question is from Union, Intersection & Complement topic in division Finite Automata of Automata Theory
Reverse of (0+1)* will be(a) Phi(b) Null(c) (0+1)*(d) (0+1)The question was asked during an online interview.I would like to ask this question from Union, Intersection & Complement topic in division Finite Automata of Automata Theory
Which of the following do we use to form an NFA from a regular expression?(a) Subset Construction Method(b) Power Set Construction Method(c) Thompson Construction Method(d) Scott Construction MethodI have been asked this question in unit test.The above asked question is from Equivalence of NFA and DFA topic in portion Finite Automata of Automata Theory
If L1 and L2 are regular languages, which among the following is an exception?(a) L1 U L2(b) L1 – L2(c) L1 ∩ L2(d) All of the mentionedThis question was posed to me by my college director while I was bunking the class.This interesting question is from Applications of DFA topic in chapter Finite Automata of Automata Theory
The automaton which allows transformation to a new state without consuming any input symbols:(a) NFA(b) DFA(c) NFA-l(d) All of the mentionedI got this question in an internship interview.This interesting question is from Uses of Epsilon-Transitions topic in division Finite Automata of Automata Theory
If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:(a) initial state(b) transition symbol(c) accepting state(d) intermediate stateI got this question in an online interview.My question is taken from Extended Transition Function in portion Finite Automata of Automata Theory
String X is accepted by finite automata if .(a) δ*(q,x) E A(b) δ(q,x) E A(c) δ*(Q0,x) E A(d) δ(Q0,x) E AThis question was posed to me in an online interview.This is a very interesting question from Finite Automata topic in division Finite Automata of Automata Theory
The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________(a) 14 states(b) 13 states(c) 12 states(d) A password pass system cannot be created using DFAI got this question during an interview for a job.This is a very interesting question from DFA Processing Strings topic in section Finite Automata of Automata Theory
Which of the following belongs to the epsilon closure set of a?(a) {f1, f2, f3}(b) {a, f1, f2, f3}(c) {f1, f2}(d) none of the mentionedI got this question in examination.I need to ask this question from Mealy Machine-II in division Finite Automata of Automata Theory
State true or false:Statement: Both NFA and e-NFA recognize exactly the same languages.(a) Statement: Both NFA and e-NFA recognize exactly the same languages.(b) true(c) falseI got this question by my school teacher while I was bunking the class.My enquiry is from Mealy Machine-II topic in division Finite Automata of Automata Theory

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment