谁能解释有限状态机和有限自动机之间的区别? [英] Can anyone please explain difference between finite state machine and finite automata?

问题描述

有人可以举例说明有限状态机和有限自动机有什么区别吗?

Can anyone please explain with example what is the difference between finite state machine and finite automata?

推荐答案

有限状态机" FSM和有限自动机"(或有限状态自动机)FA

Both "Finite State Machine" FSM and "Finite Automata" (or Finite State Automata) FA means same, represents an abstract mathematical model of computation for the class of regular languages.

有限"一词以有限数量的状态Q的形式表示有限数量的内存的存在(请阅读:普通语言的有限性).

The word "Finite" significance the presence of the finite amount of memory in the form of the finite number of states Q (read: Finiteness of Regular Language).

通常在形式理论(或计算理论)中，我们更喜欢使用自动机"一词.强调我们的机器是自动"机器(自动移动:就像我们的计算机一样)—从某种意义上说，自动"是指一旦您定义了转移规则，您就不必不需要将任何显式智能应用到处理字符串(您只需要在每个步骤中引用转移规则)即可.请记住，定义过渡机器背后的最终目的是使计算任务自动化(我认为 与其他旨在节省能源的机械机器稍有不同，例如织机).

Generally in formal-theory (or theory of computation), we prefer to use the word "Automata" – to emphasise that our machine is 'automatic' machine (self-moving: like our computer) — "automatic" in the sense that once you have been defined transition rules, you do not need to apply any explicit intelligent to process strings (you just need to refer transition rules at each step). Remember our ultimate aim behind defining transition machines is to automate the computational task (I think slightly different than another kind of mechanical machines whose purpose is to save energy e.g weaving machines).

顺便说一句，自动机或状态机是描述过渡规则的图形表示(有时比较容易).您还可以使用转换表" 或转换功能"，例如映射" .

By the way, automata or state-machines are a graphical representation to describe transition rules (that is comparatively easy sometimes). You can also use "Transition Tables" or "Transition function" like δ(q0, a) → q1. Basically, all uses for the same purpose just to define "Mappings".

这篇关于谁能解释有限状态机和有限自动机之间的区别?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！