Question

Examination #2 100 points CS248 Theory of Computation 1. Please read all instructions (including these) carefully. You should look through the entire exam before strategy. You have 50 minutes to complete the exam. This exam is closed books and closed notes. 2. Please write your solutions in the spaces provided on the exam. Make sure your solutions are neat and the exam pages as scratch paper. (Last 4 digits o NAME: (Print) First Last In accordance with both the letter and spirit of the Honor Code, I have neither given nor received assistan 1. Design a NFA that accepts all strings begin with 'a' over x = {a, b} . (10 points) 2. Design a NFA that accepts all strings contain with 'ab' over = {a, b}. (10 points) 3. Design a NFA that accepts all strings end with 'ab' over 2 = {a, b}. (10 points)

Answer 1

Solution:-

1.

(0) Design a NFA that accepts all strings begin with 'a' over { = {2,6} . Jazb or ondernemen in form of The above NFA can be defined 5 tuple as: M: (9,,8,10, F) where 4 Q = finite set of states. = { 20,21} y { e non. empty set of symbols called as . input alphabets. sparb} 8 = Qx8→ 29 is a total function . called as a transitim functim. ..

states To 2 1 2 l u. 119, → initial state : 90 E Q ise is the 20 e final states. fe Q is a set of 1. {2,}

2.

. 2. Design a NFA that, accepts all Strings contain with lab! over E = {a,b} in amb The above NFA can be defined form of 5 tuple as : MECA, &, 8, 90,F) Q.7 Set of all states. {ALB,C) En input alptiabetes . {azby 8.- Transition function QUE = 29. (states , albo A ALBI A Balacl! qos E Initial state & A set of final states {e}
3.

3: Design a NFA that accepts all strings end with 'at' over {= {a,bl. The above NFA can be defined in form of 5 tuple as: M=(2,5,8,10,F). G { 118,c} Set of all states. { {a,b} input alphabets S - Qxs - 29 fransition functim. [states ! a states % = F. a fc} initial state set of final states

Here I attached solutions for given questions

For Any Queries Please Comment

Please Do Like