toc约束理论_计算理论导论（TOC）

toc约束理论

Definition:

定义：

It is a branch of computer science that actually finds out how a problem could be solved efficiently with the help of a model of computation using some kind of an algorithm.

它是计算机科学的一个分支，实际上发现了如何使用某种算法在计算模型的帮助下有效地解决问题。

What is an automata?

什么是自动机？

It is an abstract model of digital computer. There is input tape in every automata to read input written on a file one cell at a time from left to right. Some form of output is also produced by the automation. There is also a control unit which can be in any one of the finite no of internal states.

它是数字计算机的抽象模型。 每个自动机中都有输入磁带，以读取从文件写入文件的输入，从左到右每次一个单元。 自动化还会产生某种形式的输出。 还有一个控制单元，可以处于内部状态的无限个中的任何一个。

Examples of automata machines:

自动机的示例：

Finite state machine, context free language, Turing machine, etc.

有限状态机，上下文无关语言，图灵机等。

Practical applications of theory of computation:

计算理论的实际应用：

• Traffic lights

  红绿灯

• Lifts and elevators

  升降机和电梯

• Marketing

  营销学

• Compilers

  编译器

• Vending machines

  自动售货机

• Cloud computing

  云计算

Prerequisites:

先决条件：

• Symbol: a, b, c, 0, 1, 2, ...

  符号： a，b，c，0、1、2，...

• Alphabet: finite collection of symbols {a,b}, {0,1,2} , ...

  字母：符号{a，b}，{0,1,2}，...的有限集合

• String: sequence of symbols aaaaa,ababa,…..

  字符串：符号aaaaa，ababa等的顺序.....

• Length of string: no. of symbols in a string |aaabc|=5

  字符串长度：不。 字符串中的符号| aaabc | = 5

• Language: set of strings {aaaabbb,abbbc}, ...

  语言：一组字符串{aaaabbb，abbbc}，...

• Powers of 'Σ': If Σ = {c,b} then

  'Σ'的幂：如果Σ= {c，b}，则

  Σ⁰ = Set of all the strings over Σ of length 0. {ε}

  ^Σ0 =设定的所有的字符串超过Σ长度为0 {ε}的

  Σ¹ = Set of all the strings over Σ of length 1. {c, b}

  ^Σ1 =集的所有的字符串在长度1的Σ{C，B}

  Σ² = Set of allthe strings over Σ of length 2. {cc, cb, bc, bb}

  ^Σ2 =设定allthe串在长度为2的Σ的{CC，CB，BC，BB}

  i.e.

  即

  |Σ²|= 4 and Similarly, |Σ³| = 8

  ^|Σ2 | = 4和类似地^，|Σ3 | = 8

• Cardinality: it is the number of the elements in the set.

  基数：是集合中元素的数量。

• Transition function: An automata is supposed to operate in a discrete time frame.at one point of time, the control unit is in some internal state and the input mechanism is scanning a certain symbol on the input tape. The internal state of this control unit at the next point of time or step is called the next state or the transition function. This transition function gives the next state in terms of the current state, the current input symbol on the input tape, and the information currently in the temporary storage. During the transition from the one step to the next step, the output may get generated or the information in the temporary storage may get changed.

  过渡功能：自动机应该在离散的时间范围内运行，在某个时间点，控制单元处于某种内部状态，并且输入机构正在扫描输入磁带上的某个符号。 该控制单元在下一个时间点或下一个步骤的内部状态称为下一个状态或转换功能。 此转换函数根据当前状态，输入磁带上的当前输入符号以及临时存储器中当前的信息给出下一个状态。 在从一个步骤过渡到下一步的过程中，可能会生成输出，或者可能会更改临时存储区中的信息。

• Move: The term configuration refers to a particular state of the control unit, the input tape, and the temporary storage. The transition from one stage to the next is called a move.

  移动：术语配置是指控制单元，输入磁带和临时存储器的特定状态。 从一个阶段到下一个阶段的过渡称为移动。

What is a transition graph?

什么是过渡图？

It is a directed graph. There is an initial state, internal states, and final states. the final state is also known as an accepting state. The vertices denoted by circles are used to represent states. The final state is denoted by two circles. The initial state has a one side arrow pointed towards it attached. The edges are the lines with the arrows which show the transition or the move. The edge connects one state to the other state. The edge may also be a self-loop pointing towards itself. The state is changed by using a state function and an output is given using a machine function.

它是有向图。 有初始状态，内部状态和最终状态。 最终状态也称为接受状态。 用圆圈表示的顶点用于表示状态。 最终状态由两个圆圈表示。 初始状态有一个指向它的单向箭头。 边缘是带有箭头的线，表示过渡或移动。 边缘将一个状态连接到另一状态。 边缘也可以是指向自身的自环。 通过使用状态功能更改状态，并使用机器功能提供输出。

Ex:

例如：

翻译自: https://www.includehelp.com/toc/introduction-to-theory-of-computation.aspx

toc约束理论