CS402 Theory of Automata Assignment No. 1 Solution and Discussion Spring 2015 Due Date: May 21, 2015 spring 2015 vu semesterView more random threads:
- CS401 Computer Architecture and Assembly Language...
- CS001 Computer Proficiency Assignment no 2 Discussions...
- CS403 Database Management System Assignment No. 3 spring...
- CS301‐ Data Structures Assignment No. 01 Spring 2013
- CS605 Software Engineering-II Assignment No.4 January 2013
- FIN621 Financial Statement Analysis Assignment No.2...
- CS615 Software Project Management Assignment No. 2 Solution...
- CS408 Human computer Interaction Assignment NO 4 June 2012
- CS606 Compiler Construction Assignment No.1 Solution Spring...
- CS402 Theory of Automata Assignment 2 Due date 24 April 2012
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)