Automata Theory 简明教程

Discuss Automata Theory

Automata Theory 是计算机科学的一个分支，它涉及设计遵循规定操作顺序自动执行的抽象自推进计算设备。具有有限状态数的自动机称为 Finite Automaton 。这是一个简短而简洁的自学教程，介绍有限自动机、正规语言和下推自动机的基本概念，然后进入图灵机和可判定的学习。

Automata Theory is a branch of computer science that deals with designing abstract selfpropelled computing devices that follow a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton. This is a brief and concise tutorial that introduces the fundamental concepts of Finite Automata, Regular Languages, and Pushdown Automata before moving onto Turing machines and Decidability.