CS402 Theory of Automata Assignment No. 1 Solution and Discussion Spring 2015 Due Date: May 21, 2015 spring 2015 vu semesterView more random threads:
- CS501 Advance Computer Architecture assignment no 5 fall...
- CS605 VU Current Assignment No. 4 Fall January 2012
- Advance Computer Architectuer CS501 FALL 2010 second...
- CS403 Database Management Systems assignment no 3 fall...
- CS101 Introduction to Computing Assignment No. 03 Semester...
- MTH603 Numerical Analysis Assignment 1 Idea Solution...
- CS615 Assignment No. 05 Spring 2011 idea Solution
- CS506 Web Design and Development assignment no 1 spring...
- CS402 Assignment No.4 Spring 2011
- CS507 Information Systems Assignment no 2 Spring fall 2...
Q.1. Write Regular Expressions (RE) for the following languages:
- The language of all strings defined over Σ = {U, V, W} that begins with V, ends with U and having minimum length of 3.
- The language of all strings defined over Σ = {U, V, W} with V as the third letter and W being the second last letter.
[Marks 4+4]
Q.2. Draw Finite Automata (FA) for the languages in Q.1
[Marks 6+6]
Sponsored Links
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
There are currently 1 users browsing this thread. (0 members and 1 guests)