Reference no: EM132780706
UU-COM-3001 Computational theory - Unicaf University
Assignment 1
Problem 1
Given a DFA for the following languages, specified by a transition diagram. For each one of them, give a short and clear description of how the machine works. Assume the alphabet is Σ = {0,1,2}:
(a) L1 = {w | w is any string over Σ that contains at least one '0'.}
(b) L2 = {w | w contains even number of 0s and an odd number of 1s.}
(c) L3 = {w = 0u12v | u,v are any strings over Σ.}
Problem 2
This problem concerns the NFA given by the following transition table:
|
0
|
1
|
→ q0
|
{q0}
|
{q0, q1}
|
q1
|
Φ
|
{q1, q2}
|
∗q2
|
Φ
|
Φ
|
Convert this NFA to a DFA using the method described in class. Specify the DFA by its transition diagram.
Your work needs to be well written and have quality information. Your work must be clear and has to be able to educate someone with no prior knowledge in Computational theory.
Attachment:- Computational theory.rar