1 / 6

Theory of Computing CSCI 356/541

Theory of Computing CSCI 356/541. Lab Session 3. Outline Lab 3:  Turing Machine  Building A Turing Machine  Multi-Tape Turing Machines. Exercise 1. Consider the language L = {uvz#v : u, v, z  {0, 1}*} . In other words,

torgny
Download Presentation

Theory of Computing CSCI 356/541

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Theory of ComputingCSCI 356/541 Lab Session 3

  2. Outline Lab 3: Turing Machine Building A Turing Machine Multi-Tape Turing Machines

  3. Exercise 1. Consider the language L = {uvz#v : u, v, z  {0, 1}*}. In other words, L is the set of all pairs w#v of binary words separates by special symbol # such that w contains v as a substring. Build a Turing machine (In JFLAP) with one tape that terminates on all inputs and accepts precisely the strings in L. Hand in the idea behind your solution and a screenshot of the built Turing machine with input strings: {110011001101010#1001, λ, 110011001101010#11001, 110011001101010#1111, #, 110011001101010#10101, 110011001101010#101101} N.B. Please send me your JFLAP file along with your answer.

  4. http://cseweb.ucsd.edu/classes/sp08/cse105/hw4s.pdf

  5. 2. Develop a Multi-tape Turing machine with two tapes, T1 and T2, with both tapes having input alphabet of ={a, b} and tape alphabet of  ={ם, a, b}. The machine accepts if the string in T1 is a substring of the string in T2, and rejects otherwise. Hand in a screenshot of the built Turing machine with the stepwise simulation with:

  6. Exercises are due on next Monday, 28th November.

More Related