COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
* Q
|
|
|
Q * Q
|
|
|
*
|
|
|
Q *
|
Detailed explanation-1: -The transition relation of a DFA is the set of all pairs (q, au) →R ((q, a), u) where q ∈ Q, a ∈ and u ∈ ∗. In other words, the automaton can go from state q and a nonempty input au with first symbol a, to the new state (q, a) while keeping the remaining portion of the input u .
Detailed explanation-2: -":Q× → Q” says is a transition function that defined mapping from Q× to Q . Where, Domain of is Q × and Range is Q . Note: Cartesian Product itself a mathematical that all possible order pair (mapping) between two sets. Here, Q is finite set of states and is a finite set of language symbols.
Detailed explanation-3: -2. What is the transitional function of a DFA? Explanation: Q is the finite set and let be a finite set of symbols so Q X fives no of states.
Detailed explanation-4: - : Transition Function, defined as : Q X –> Q. In a DFA, for a particular input character, the machine goes to one state only. A transition function is defined on every state for every input symbol. Also in DFA null (or ) move is not allowed, i.e., DFA cannot change state without any input character.