Question
L= {xϵ∑= {a, b} | x starts with a and ends with b}
a.
δ (q0, a) =q0
b.
δ (F, a) =q1
c.
δ (F, a) =D
d.
δ (q1, a) =D
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which among the following is the missing transition in the given DFA? L= {xϵ∑= {a, b} | x starts with a and ends with b}
Similar Questions
Discover Related MCQs
Q. The complement of a language will only be defined when and only when the __________ over the language is defined.
View solution
Q. Which among the following is not notated as infinite language?
View solution
Q. Which among the following states would be notated as the final state/acceptance state?
L= {xϵ∑= {a, b} | length of x is 2}
View solution
Q. Which of the following are the final states in the given DFA according to the Language given ?
L= {xϵ∑= {a, b} |length of x is at most 2}
View solution
Q. Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?
View solution
Q. Choose the correct option for the given statement:
Statement: The DFA shown represents all strings which has 1 at second last position.
View solution
Q. According to the given table, compute the number of transitions with 1 as its symbol but not 0:
View solution
Q. From the given table, δ*(q0, 011) =?
View solution
Q. Number of times the state q3 or q2 is being a part of extended 6 transition state is
View solution
Q. Predict the missing procedure:
1.Δ(Q0, ε) ={Q0},
2.Δ(Q0, 01) = {Q0, Q1}
3.δ(Q0, 010) =?
View solution
Q. Which of the following does the given NFA represent?
View solution
Q. The number of transitions required to convert the following into equivalents DFA:
View solution
Q. Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1} | 3rd bit from right is 0}
View solution
Q. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
View solution
Q. An e-NFA is ___________ in representation.
View solution
Q. State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.
View solution
Q. Which of the following belongs to the epsilon closure set of a?
View solution
Q. The number of elements present in the e-closure(f2) in the given diagram:
View solution
Q. If R represents a regular language, which of the following represents the Venn-diagram most correctly?
View solution
Q. The given NFA corresponds to which of the following Regular expressions?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!