Question

8: The transitional function of a DFA is
ΟΧΣ 2η
Ο ΟΧΣ Qη
Ο ΟΧΣ 20
Ο ΟΧΣ 0​

Answer 1

Answer:

Mark me as a brainliest

Explanation:

δ : 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

Answer 2

Answer:

hey watch the above pic for ur answer of the question