ALGO_SP08_T1

ALGO_SP08_T1 - MAD 3512 TEST - THEORY OF ALGORITHMS #1 -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
(15) (15) (20) (15) (20) (15 ) MAD 3512 - THEORY OF ALGORITHMS FLORIDA INT'L UNIV. TEST #1 - SPRING '08 TIME: 75 min. Answer all 6 questions. Provide all reasioning and show all working. An unjustified answer will receive ,little or no credit. BEGIN EACH QUESTION ON A SEPARATE PAGE. 1. (a) Define what is the extended transi - tion function of a DFA. (b) Convert the NFA on the right into an equivalent DFA. Find regular expressions which describe the languages below (a) Ll = {~E{a,b}*: ~ contains both aab ~ bab as substrings} (b) L2 = {~E{O,l}*: ~ has at most one ocqurrence of 01} 2. 3. 4. 5. 6. (a) (b) Find all the inaccessible states im the DFA below. Then partition the remaining sQates into blocks of indistinguishable states and find the reduced machine. w CW C -?>D @ G) G H I ~--------------- 01 D G B B (jI CAB 11 F BFA E, A H G (a) Find a DFA which accepts precisely the strings in the language L4 = {CD E{a,b}*: [nb(CD) -n)(CD) -1] (mod 4) < 2}. Verify
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/27/2011 for the course MAC 3512 taught by Professor Ramsau during the Fall '10 term at FIU.

Page1 / 4

ALGO_SP08_T1 - MAD 3512 TEST - THEORY OF ALGORITHMS #1 -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online