cs402 assignment 2 solution spring 2020

cs402 assignment 2 solution spring 2020

 

Assignment No. 02

Semester: Spring 2020 Theory of Automata – CS402

 

Total Marks: 20

 

Due Date: June 15, 2020

 

  1. Write a regular expression for a language over alphabet L = {a,b} accepting all strings and ending with b only. Convert the given regular expression into NFA and then convert the NFA to DFA.

 

[4 + 8 + 8 = 20 marks]

 

 

A regular expression for a language over alphabet L = {a,b} accepting all strings and ending with b only is as given below:

 

RE = (a+b)* b

 

The above regular expression may be equivalent to the following NFA

cs402 assignment 2 solution spring 2020



Please do not copy and paste prepare this assignment by yourself. it is just idea solution only.

you can use your own label according to your lectures.

You May Also Like

Leave a Reply

%d bloggers like this: