Академический Документы
Профессиональный Документы
Культура Документы
1.
(6 Marks)
Solution: The central concepts of automata theory are a) Alphabet. (1 mark) b) Strings (1 mark) c) Empty string & length (1 mark) d) Power of An Alphabet (1 mark) e) Concatenation of Strings (1 mark) f) Language (1 mark) B) Convert the following DFA to Regular Expression using state Elimination method (6 Marks) 0 s p r q 1 p s q R
*p
q r s
2.
(6 Marks)
Solution: DFA (3 Marks) A is the Name of the DFA Q is the Set of States is the Set of Inputs is the Transition Function q0 is the Starting State F is the Set of Accepting States
How a DFA Processes Strings (3 Marks) B) (1) Form a DFA which accepts the set of all strings such that the number of zeroes is odd (2 Marks) (2) Form an NFA to recognize the following strings : lab, cab, dab (Assume the Alphabet is {a,b,c,d,l}) (4 Marks) Solution : (1) 1 0 1
q0
0 (2)
q1
q1
q4 q5 q6
q0
q2 q3
q7
q8
q9
3.
A) Describe NFA & explain the simpler notations of Finite Automata (6 Marks) B) Convert to a DFA the following NFA 0 {p,q} {p,r} 1 {p} {r} {q} (6 Marks)
p q *r
Solution: A)
NFA (2 Marks) A is the Name of the DFA Q is the Set of States is the Set of Inputs is the Transition Function q0 is the Starting State F is the Set of Accepting States Transition Diagram (2 Marks) Transition Table (2 marks) B) 1 0 0
p,q
0,1 1
p,r
0
p,q,r