Number of times the state q3 or q2 is being a part of extended 6 transition

Number of times the state q3 or q2 is being a part of

This preview shows page 148 - 157 out of 189 pages.

9. Number of times the state q3 or q2 is being a part of extended 6 transition state is
Background image
3/4
Background image
8/27/2019Extended Transition Function - Automata Theory Questions andANSWERs - SanfoundryViewANSWER 10. Predict the missing procedure: 1.Δ(Q0, ε) ={Q0},2.Δ(Q0, 01) = {Q0, Q1}3.δ(Q0, 010) =?advertisement
Background image
ViewANSWER4/4
Background image
8/27/2019NFA Language - Automata Theory Questions andANSWERs - SanfoundryAutomata Theory Questions andANSWERs – The Language of NFAThis set of Automata Theory Multiple Choice Questions &ANSWERs (MCQs) focuses on “The Languageof NFA”.1.Subset Construction method refers to: a) Conversion of NFA to DFAb) DFA minimizationc) Eliminating Null referencesd) ε-NFA to NFAViewANSWERAnswer: aExplanation: The conversion of a non-deterministic automata into a deterministic one is a process we call subset construction or power set construction.advertisement 2. Given Language:Ln= {x{0,1} * | |x|≥n, nth symbol from the right in x is 1}ϵHow many state are required to execute L3using NFA? ViewANSWER
Background image
3. Which of the following does the given NFA represent? 1/4
Background image
8/27/2019NFA Language - Automata Theory Questions andANSWERs - SanfoundryViewANSWER 4. The number of transitions required to convert the following into equivalents DFA: ViewANSWER
Background image
advertisement5.If L is a regular language, Lcand Lrboth will be: a)Accepted by NFAb) Rejected by NFAc) One of them will be accepted d) Cannot be saidViewANSWERAnswer: aExplanation: If L is a regular Language, Lcand Lrboth are regular even.2/4
Background image
8/27/2019NFA Language - Automata Theory Questions andANSWERs - Sanfoundry6.In NFA, this very state is like dead-end non final state: a) ACCEPTb) REJECT c)DISTINCT d)STARTViewANSWERAnswer: bExplanation: REJECT state will be like a halting state which rejects a particular invalid input.
Background image
Image of page 157

You've reached the end of your free preview.

Want to read all 189 pages?

  • Spring '20
  • Regular expression, Nondeterministic finite state machine, Automata theory, Automata Theory Questions

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture