Question

Consider the language L below. (a) Is L a regular language? – Yes, or No. (b) If L is a regular language, design the DFA (using a State Table) to accept the language L, with the minimum number of states.  Assume , (c) Suppose the input is “101100”. Is this input string in the language L?

Σ = {0,1}

Answer 1

Given language,

L={w l w has both an even number of O's and an odd number of 1's}

a)

Yes, the given language is regular language.

b)

9 %, *, 9, 1 ขอ * ข, Trasition table state diagram

c)

The given string is "101100" is not in the language.

q1 --1--> q2 --0--> q3 --1--> q2 --1--> q3 --0--> q2 --0--> q3 which is not final state.