Unformatted text preview: [20 Points] 4) From Section 5.5 Do exercise 2, 4, 5, 6 [20 Points] 5) Consider a Turing Machine with the following specification [20 Points] 1. Set of states: { k , k 1 , k 2 , k 3 } 2. Tape symbols: { A , B , C } 3. Final (or halting) state is k 3 4. Transition Functions: δ ( k , A ) = ( k 2 , C , R ); δ ( k 1 , C )= ( k 2 , B , R ); δ ( k 1 , A )= ( k 3 , C , L ); δ ( k 2 , A ) = ( k 1 , C , L ); δ ( k 2 , C ) = ( k 1 , B , R ) Assume your TM’s initial configuration is as shown below. 1. Show the mapping of the elements of this TM to a protection system. 2. Show all possible transitions, indicating each new TM configuration reached (i.e., state, head position and the symbols in each cell) and its corresponding protection state (the entries in the Access Control Matrix)....
View
Full
Document
This note was uploaded on 11/02/2009 for the course SIS 2150 taught by Professor Joshi during the Spring '09 term at Philadelphia.
 Spring '09
 joshi

Click to edit the document details