# Restricted Turing Machines

In this article, we are going to describe the basics concepts of the restricted Turing machine and for basic understanding, you can first read the pre-requisite which will help you to understand the topic clearly.

**Prerequisite –** Turing Machine

- Turing Machine accepts the recursively enumerable language. It is more powerful than any other automata such as FA, PDA, and LBA. It computes the partial recursive function. It can be further divided into Deterministic Turing Machine(DTM) or Non-Deterministic Machine(NTM). By default, Turing Machine is DTM, and the power of DTM and NTM are the same.
- This machine acts as a Recognizer or Acceptor and as an Enumerator.
- The machine is said to be as acceptor which accepts or recognizes the strings of a recursively enumerable language (L) over the input alphabet(∑ ) and the machine is said to be as enumerator which enumerates the string of recursively enumerable language over the input alphabet ∑.

The restricted Turing machines can be of the following types :

**Halting Turing Machine :**

A Turing Machine is said to be a halting Turing machine if it always halts for every input string. It can accept the recursive language and is less powerful than Turing machine.**Linear Bounded Automata :**

It behaves as a Turing machine but the storage space of tape is restricted only to the length of the input string. It is less powerful than a Turing machine but more powerful than push down automata.**Unidirectional Turing Machine :**

The head of this type of turing machine can move only in one direction. It can accept the only regular language. It has the same power as finite automata but less powerful than push down automata.**Read Only Turing Machine :**

It is equivalent to finite automata. It contains a read head only which doesn’t have written capability. It accepts only regular languages.**Read Only-Unidirectional Turing Machine :**

It is similar to finite automata. It contains a read-only head and can move only in one direction. It accepts a regular language.