For the following DFA, give a regular expression for each of the languages indic

Question

For the following DFA, give a regular expression for each of the languages indicated.

When the question refers to a machine “passing through” a given state, that means

entering and then exiting the state. Merely starting in a state or ending in it does not

count as “passing through.”

Mo 12 43 the language of strings that make the machine, if started in q, end in q, without passing a. e machine, if started in a end in a, without bassin through 4, q 2 or 4, through 4, q 2 or 4, through q,q, or q, through qo or q, b. the language of strings that make the machine, if started in qo, end in q,, without passing e language of strings that make the machine, if started in qo, end in q2, without passing c. the language of strings that make the machine, if started in q, end in qp without passing d. the language of strings that make the machine, if started in q, end in q,, without passing e language of strings that make the machine, if started in q2, end in q2, without passing

Explanation / Answer

Ans a: {}

b: {b}

c: {b}

d:{a,a}

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---