Select all the statements below which are true: A language accepted by some dfa

Question

Select all the statements below which are true: A language accepted by some dfa is a regular language and a language accepted by some nfais a nonregular language g3 Let = {a1 , a2 , . . . , an }. Let M be a dfa and let GM be the corresponding transition graph. Let m be the number of vertices in GM. Then m>n. Let = {0, 1, 2} and qo be the initial state of a dfa M. Then the transition graph of M has3 outgoing edges in qo- There are languages accepted by dfa's which cannot be accepted by nas Let = {a, b, c} and M be a nfa. Let gi be a state of NM. Then (ai , a) C * (qi , a) . Transition function of a dfa can be defined using atransition table.

Explanation / Answer

a. False

languages accespted by NFA or DFA are regular.

b. False

Number of states and length of alphabets can not be same

and there is no relation. Anyone can be greater

So, it may be m > n ot n > m

c. True.

In DFA, we specify outgoing edge for all literal of alphabets

Here there are three literals so, there will be three

outgoing edges from each state(vertex)

d. False

DFA and NFA are equivalent in power

e. True

In NFA, we have multiple choice for transaction for a alphabets from a state

f. True

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.