Theory of Automata CS402 Assignment No 1 Solution Spring 2019 with Step By Step Guide

 Info!  Please Don't Make 100% copy of your assignment Solution. Make some changes so that your solution look differrent than other students. If you make Exact copy of then you can get marks zero.

Solution of CS402 Assignment No1 2019 Theory of Automata

Steps invloved to solve this assignments

Question-1  Construct a regular expression (RE) defining each of the following languages over the alphabet

∑={a b}:

a) All words ends in 3 consecutive b.
b) All words having at least one ‘a’

Solution:
       Answer of this question is given below; please see the video demo given below to know all the steps to solve this.

Answer is

a) R.E. = (a+b)*bbb

b) R.E. = (a+b)*a(a+b)

Question-2  Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’.

Answer: FA Diagram

FA Diagram

If you want to download solution file in MS Word Document then

Watch Demo video of Solution

If you have any Problem regarding your assignment Solution then you can contact Us or leave a Comment below. You can also subscribe our Official YouTube Channel to get guided videos of all assignments, quizes or GDB. You can also join our Official WhatsApp Groups by Click on the links Below.

Description	Links
YouTube Channel:	Infopalacess Official Tuts
WhatsApp Group 1:	VU Assignments Portal by Infopalacess 2
WhatsApp Group 2	VU Assignments Portal by Infopalacess 2