The Off-Line Machine Input File read-only (once) Input string

Slides:



Advertisements
Similar presentations
Variations of the Turing Machine
Advertisements

Lecture 16 Deterministic Turing Machine (DTM) Finite Control tape head.
Variants of Turing machines
Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
Turing’s Thesis Fall 2006 Costas Busch - RPI.
Courtesy Costas Busch - RPI1 Non Deterministic Automata.
1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata are like Turing Machines with a restriction: The working space of the tape is the space of the.
Fall 2006Costas Busch - RPI1 Deterministic Finite Automata And Regular Languages.
Computability and Complexity 7-1 Computability and Complexity Andrei Bulatov Recursion Theorem.
Recursively Enumerable and Recursive Languages
Courtesy Costas Busch - RPI1 Turing’s Thesis. Courtesy Costas Busch - RPI2 Turing’s thesis: Any computation carried out by mechanical means can be performed.
Fall 2006Costas Busch - RPI1 The Post Correspondence Problem.
Courtesy Costas Busch - RPI1 Turing Machines. Courtesy Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Variations of the Turing Machine part2. 2 Standard Machine--Multiple Track Tape track 1 track 2 one symbol.
Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.
Fall 2005Costas Busch - RPI1 Recursively Enumerable and Recursive Languages.
Costas Busch - RPI1 Turing Machines. Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Courtesy Costas Busch - RPI1 Reducibility. Courtesy Costas Busch - RPI2 Problem is reduced to problem If we can solve problem then we can solve problem.
Fall 2006Costas Busch - RPI1 PDAs Accept Context-Free Languages.
Costas Busch - LSU1 Non-Deterministic Finite Automata.
Fall 2004COMP 3351 Turing’s Thesis. Fall 2004COMP 3352 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine.
Prof. Busch - LSU1 Pushdown Automata PDAs. Prof. Busch - LSU2 Pushdown Automaton -- PDA Input String Stack States.
Prof. Busch - LSU1 Turing Machines. Prof. Busch - LSU2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Prof. Busch - LSU1 Reductions. Prof. Busch - LSU2 Problem is reduced to problem If we can solve problem then we can solve problem.
1 Turing Machines. 2 A Turing Machine Tape Read-Write head Control Unit.
Prof. Busch - LSU1 NFAs accept the Regular Languages.
A Universal Turing Machine
Costas Busch - LSU1 Turing’s Thesis. Costas Busch - LSU2 Turing’s thesis (1930): Any computation carried out by mechanical means can be performed by a.
NP-complete Languages
Costas Busch - LSU1 Linear Grammars Grammars with at most one variable at the right side of a production Examples:
Costas Busch - LSU1 The Post Correspondence Problem.
Costas Busch - LSU1 PDAs Accept Context-Free Languages.
Turing Machines. The next level of Machine… PDAs improved on FSAs by adding memory. We make the memory more flexible to do more complicated tasks.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Costas Busch - RPI1 Decidability. Costas Busch - RPI2 Another famous undecidable problem: The halting problem.
1 A Universal Turing Machine. 2 Turing Machines are “hardwired” they execute only one program A limitation of Turing Machines: Real Computers are re-programmable.
Fall 2006Costas Busch - RPI1 RE languages and Enumerators.
Costas Busch - LSU1 Deterministic Finite Automata And Regular Languages.
Turing’s Thesis.
Turing’s Thesis Costas Busch - LSU.
A Universal Turing Machine
Recursively Enumerable and Recursive Languages
PDAs Accept Context-Free Languages
Busch Complexity Lectures: Turing Machines
Busch Complexity Lectures: Reductions
Undecidable Problems Costas Busch - LSU.
Reductions Costas Busch - LSU.
Pushdown Automata PDAs
CSCI 2670 Introduction to Theory of Computing
OTHER MODELS OF TURING MACHINES
Turing’s Thesis Costas Busch - RPI.
Computing Functions with Turing Machines
Busch Complexity Lectures: Undecidable Problems (unsolvable problems)
Turing acceptable languages and Enumerators
Deterministic Finite Automata And Regular Languages Prof. Busch - LSU.
Non-Deterministic Finite Automata
Properties of Regular Languages
Non-Deterministic Finite Automata
Decidable Languages Costas Busch - LSU.
Space Complexity Costas Busch - LSU.
The Post Correspondence Problem
A Universal Turing Machine
Turing acceptable languages and Enumerators
Undecidable problems:
Variations of the Turing Machine
More Applications of the Pumping Lemma
Formal Definitions for Turing Machines
The Chomsky Hierarchy Costas Busch - LSU.
Presentation transcript:

The Off-Line Machine Input File read-only (once) Input string Appears on input file only Input string Control Unit (state machine) Tape read-write Costas Busch - LSU

have the same power with Standard Turing machines Theorem: Off-Line machines have the same power with Standard Turing machines Proof: 1. Off-Line machines simulate Standard Turing machines 2. Standard Turing machines simulate Off-Line machines Costas Busch - LSU

1. Off-line machines simulate Standard Turing Machines 1. Copy input file to tape 2. Continue computation as in Standard Turing machine Costas Busch - LSU

Standard machine Off-line machine Tape Input File 1. Copy input file to tape Costas Busch - LSU

2. Do computations as in Turing machine Standard machine Off-line machine Tape Input File 2. Do computations as in Turing machine Costas Busch - LSU

2. Standard Turing machines simulate Off-Line machines: Use a Standard machine with a four-track tape to keep track of the Off-line input file and tape contents Costas Busch - LSU

Standard Machine -- Four track tape Off-line Machine Tape Input File Standard Machine -- Four track tape Input File head position Tape head position Costas Busch - LSU

Repeat for each state transition: Return to reference point (uses special symbol # ) Input File head position Tape head position Repeat for each state transition: Return to reference point Find current input file symbol Find current tape symbol Make transition END OF PROOF Costas Busch - LSU