View more random threads:
- CS302- Digital Logic Design Assignment # 3 solution fall...
- CS610 Assignment no.3 Spring 2013 Solution (Due Date...
- cs402 assignment no 4 fall 2010 solution
- STA-301 Assignment No.1 spring 2012 idea solution on 6th...
- CS614 Assignment No. 04 Spring 2011 idea Solution
- cs601 assignment no 2 spring 2011 Idea solution on 28 April...
- CS401- Computer Architecture and Assembly Language...
- Virtual University MCS assignments solutions
- CS408 Human Computer Interaction Assignment No.2 Fall...
- CS410 Visual Programming Assignment no 1 spring fall 25...
CS402 Theory of Automata Assignment No.1 Solution Spring Semester 2013
Instructions
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
o Assignment is submitted after due date.
o Submitted assignment does not open or file is corrupt.
o Assignment is copied (From internet/ to from students).
Objective
To understand the basics of Regular Expression and Finite Automata
Sponsored Links
Assignment Submission Instructions
Assignment should be submitted in DOC / DOCX format. All other formats (like jpeg / gif / cpp / etc) are awarded as zero without marking.
Assignment
Question 1: [Marks: 10]
Σ = {a, b}
Write a Regular Expression, that only accepts strings with exactly two or three a’s in the string. There is no restriction on occurrence of b’s in the string.
Few examples of accepted strings are as under;
- bbaabbbba
- baba
- aba
- abaa
- aa
- aaa
etc.
Question 2: [Marks: 10]
Draw FA for the regular expression resulted in Question 1.
Deadline:
Your assignment must be uploaded on or before 29 April, 2013
There are currently 1 users browsing this thread. (0 members and 1 guests)