Scribd
Upload
35 views

Extensions to the Basic Turing Machine

The document discusses various extensions and variations of the basic Turing machine, including multi-tape, multi-head, two-way infinite tape, and K-dimensional Turing machines, each enhancing computational capabilities. It also covers restricted Turing machines such as Halting Turing Machines, Linear Bounded Automata, and Read-Only Turing Machines, which have specific limitations affecting their computational power. Examples illustrate how these machines operate within their defined constraints, highlighting their applications in recognizing different types of languages.

Uploaded by

akdhitsharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

Extensions to the Basic Turing Machine

The document discusses various extensions and variations of the basic Turing machine, including multi-tape, multi-head, two-way infinite tape, and K-dimensional Turing machines, each enhancing computational capabilities. It also covers restricted Turing machines such as Halting Turing Machines, Linear Bounded Automata, and Read-Only Turing Machines, which have specific limitations affecting their computational power. Examples illustrate how these machines operate within their defined constraints, highlighting their applications in recognizing different types of languages.

Uploaded by

akdhitsharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Extensions to the basic turing machine

Multi-tape Turing Machine


As the name suggests, a multi-tape Turing machine is an extension of the standard Turing
machine where multiple tapes are available for input, output, and computation. Each tape has
its own read-write head, and the machine's transition function is based on the current state
and the symbols read by each head.

Multi-head Turing Machine


In a multi-head Turing machine, a single tape is used, but it has multiple read-write heads.
These heads can independently read and write symbols, enabling the machine to perform
complex tasks more efficiently.

Two-way Infinite Tape Turing Machine


A two-way infinite tape Turing machine allows the tape to extend infinitely in both
directions, unlike the standard machine where the tape extends infinitely in only one
direction. This removes the boundary on the left side of the tape.

K-dimensional Turing Machine


A K-dimensional Turing machine extends the concept of the tape to multiple dimensions. For
example, a two-dimensional Turing machine as given in the following diagram, has a tape
that extends infinitely in both the X and Y directions.

In a two-dimensional Turing machine, the read-write head can move not only left and right
but also up and down. This added flexibility allows the machine to process more complex
data structures, such as matrices or grids. This type of Turing machine is ideal for tasks that
naturally fit a multi-dimensional space, such as image processing or simulations of physical
phenomena.
Non-deterministic Turing Machine
A non-deterministic Turing machine (NDTM) differs from a deterministic Turing machine in
that it can transition into multiple possible states from a given state and symbol. Instead of
following a single path, the NDTM can explore many computational paths simultaneously.

Restricted Turing Machines


Now let us see the idea of restricted Turing machines. These are variations of the standard
Turing machine but with specific limitations. These restrictions generally reduce the
computational power of the machine, making them less powerful than a full Turing machine.
Here are some common types of restricted Turing machines −
• Halting Turing Machine
• Linear Bounded Automata
• Unidirectional Turing Machine
• Read-Only Turing Machine
• Read-Only Unidirectional Turing Machine

Halting Turing Machine


A Halting Turing Machine is always halts for every input string. This means that no matter
what input it receives, the machine will eventually stop its computation. This type of machine
can accept recursive languages, which are a subset of recursively enumerable languages.
If we remember the definitions, recursive languages are those for which there exists a Turing
machine that halts on all inputs and correctly decides whether each string belongs to the
language.
Example
Consider a Turing machine designed to determine whether a given number is even or odd. A
halting Turing machine for this task would, read the input number. Then, determine if it's
even or odd. Halt after making the determination, ensuring that the machine always stops for
any input.
Linear Bounded Automata
A Linear Bounded Automata (LBA) is a special type of Turing machine where the tape's
storage space is limited to the length of the input string.
Unlike a standard Turing machine, which has an infinite tape, an LBA has a tape that is only
as long as the input, making it less powerful but still more powerful than a pushdown
automaton (PDA). LBAs are particularly important because they can accept context-sensitive
languages.
Example
Consider the language L={anbncn:n≥1}L={anbncn:n≥1}. This language consists of strings
where the number of 'a's, 'b's, and 'c's are all equal.
An LBA can be constructed to: verify that the number of 'a's, 'b's, and 'c's are the same.
Ensure that the tape head does not exceed the input length, effectively using the limited tape
space.
Unidirectional Turing Machine
A Unidirectional Turing Machine has a tape head that can only move in one direction, either
left or right but not both. This restriction limits the machine's power, making it equivalent to a
finite automaton (FA), which can only recognize regular languages.
Example
Consider a unidirectional Turing machine designed to recognize the
language L={w∣w∈(0,1)∗L={w∣w∈(0,1)∗ and w ends with 1}.
Here if can start at the leftmost '0' or 1 and move right. If there is 1 it can move to another
state but for 0 come back to previous state, since it will end with 1, if input ends and it is
from the next state it will accept that
Read-Only Turing Machine
Another variation is a Read-Only Turing Machine. In this type of Turing machine where the
tape head can only read symbols and cannot write on the tape. This restriction makes the
machine equivalent to a finite automaton, meaning it can only accept regular languages.
Example
A read-only Turing machine might be used to check if a string belongs to the
language L={0n:n≥1}L={0n:n≥1}. The machine would −
Read each symbol on the tape. Since it cannot write, it simply checks if all symbols are '0'
and halts, accepting the string if true.
Read-Only Unidirectional Turing Machine
Another variation of read only machine is Read-Only Unidirectional Turing Machine, which
combines the restrictions of being read-only and unidirectional. The tape head can only read
and move in one direction, making this machine very similar to a finite automaton. It can
only recognize regular languages.
Example
Consider a machine tasked with checking if a string belongs to the
language L={01n:n≥1}L={01n:n≥1}. This machine would:
Start at the first '0' and move right. Ensure that all following symbols are '1'. Since it can only
move in one direction and cannot write, it checks the sequence and accepts or rejects based
on the pattern.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy