CSCI435 Home Assignment 1Solved

Description

Q1. [25] For S = {a, b}, construct the minimal DFA that accept the language consisting of

•  all strings with an even number of a’s and an odd number of b’s.
• every ‘aa’ is followed immediately by a ‘b’. For example, the strings aab, aaba, aabaabbaab are in the language, but aaab and aabaa are not. Construct a DFA with 4 states.
•  L = {w | ( n_a(w) – n_b(w) ) mod 3 = 0 }. Construct a DFA with 3 states.

Q2. Show that the language L = { aⁿ | n ³ 0, n ¹ 3 } is regular.

Q3.  For the language L = {aⁿ | n ³ 1 } È {b^ma^k | m ³ 0, k ³ 0}

•  Construct an NFA with three states that accepts L.
•  Can you construct an NFA with the fewer states that accepts L? If so, construct it; otherwise, justify why your NFA in 1) is the minimal NFA.

Q4.  For a given NFA in the figure,

• Give a language L that is accepted by the NFA. Describe L in the proper mathematical format, not in the verbal English description.  g.) L = { aⁿ | n ³ 0, n ¹ 3 }
• Find a DFA that accepts the complement of the language defined by the NFA, i.e. .

Q5. Construct an NFA with the minimum number of states that accepts

L = { aⁿ | n ³ 0 } È { bⁿa | n ³ 1 }.

Q6.  Convert the NFA defined by the transitions below with the initial state q₀ and the final state q₂ into an equivalent DFA.  Draw the transition graph of the DFA.

d(q₀, a) = { q₀, q₁ },    d(q₁, b) = { q₁, q₂ },    d(q₂, a) = { q₂ },    d(q₁, l) = { q₁, q₂ }.

Q7.  For a given language, L = { aⁿb | n ³ 1 } È { bⁿa | n ³ 1},

•  Construct a minimal DFA with the minimum number of states that accepts L.
• Prove that your DFA in 1) is minimal. Hint: Check if any pair of the states are indistinguishable to be merged in the same class so that the number of states are minimized

Q8.  Prove or disprove the following conjecture:  If L is regular, so is L^R.

If it is true, construct a NFA M^R s.t. L(M’) = L^R , from a NFA M that accepts L, i.e. L(M) = L. Then, show that L(M’ ) = L^R .

Otherwise, give a counter example.