有限自动机和图灵机的区别

1. 有限自动机：
有限自动机或有限状态机是具有五个元素或元组的抽象机器。它有一组从一个状态移动到另一个状态的状态和规则，但它取决于应用的输入符号。基本上它是一个抽象模型 pf 数字计算机。下图显示了一般自动化的一些基本特征。

图片 :有限自动机的特点

上图显示了自动机的以下特点：

1. 输入
2. 输出
3. 自动机状态
4. 状态关系
5. 输出关系

2. 图灵机：
它是一个强大的模型，由 Alan Turing 在 1936 年提出。早期的模型，如有限自动机和下推自动机，由于无法识别简单的语言，因此被认为是准确的模型。但图灵机是个人电脑最准确的模型。图灵机能够解决真正计算机可以解决的所有问题。还有一些问题是图灵机无法解决的，因为这些问题超出了计算的理论极限。

图片 :图灵机模型

有限自动机和图灵机的区别：

Finite Automata	Turing Machine
It recognize the language called regular language.	It will recognize not only regular language but also context free language, context sensitive language and recursively enumerable languages.
In this the input tape is of finite length from both left and right side.	In this the input tape is of finite length from left but is of infinite length from right.
It consists of finite number of states, finite set of input symbols, initial state of automata and finite set of transition rules for moving from one state to another.	It also contains finite set of tape symbols and a blank symbol on the tape in addition to finite number of states, finite set of input symbols, initial state of automata and finite set of transition rules for moving from one state to another.
In this head is able to move in right direction only. In two way automata, head is able to move in both directions.	In this, head can move in both directions.
Head is only able to read the symbols from the tape but can not write symbols on the tape.	Head is able to read as well as write symbols on the tape.
It is weak as compare to Turing Machine.	It is powerful than Finite Automata.
Designing finite automata is easier.	Designing turing machine is difficult and as well as complex.
The transition function in finite automata can be represented by : δ : Q × Σ* → Q	The transition function in turing machine can be represented by : δ : Q × T → Q × T × {L, R} where L and R specifies the left and right movement of tape head.