What Is an Automatic Extension?

The control program of the computer control system has the characteristics of a finite state automaton (FA), which can be described by the theory of finite state machines. Finite Automata Machine is an important cornerstone of computer science. It is often called Finite State Machine in the field of software development. It is a very widely used software design pattern.

Automaton is

A device that logically processes a sequence of signals. In the field of automatic control, it means discrete

Automata has the following basic concepts:

symbol

Any datum that has some meaning or is valid on this machine. Symbols are sometimes called "letters."

word

Limited by the concatenation of some symbols

Here are three types of finite automata

Determining Finite Automata (DFA)

Every state of an automaton is right

The family of languages accepted by the aforementioned automata is called Regular Expression. More powerful automata can accept more complex languages. such as:

determine

Note that an automaton generally does not have to have a limited number or even several states. For example, a quantum finite automaton has an infinite number of states, because the set of all possible states is the set of all points in the complex projection space. Therefore, the quantum finite automaton, like the finite state machine, is a special case of the more general topological automaton. Its set of states is a topological space, and the state transfer function is taken from all possible functions in this space. Topological automata are often called M-automata. They are simple semiautomata plus a set of accepted states. The set intersection here determines whether the initial state is accepted or rejected.

Generally speaking, an automaton does not need to strictly accept or reject an input; it can accept it with a probability between zero and one. Let's use a quantum finite automaton as a demonstration example, which only accepts input with a certain probability. This idea is also a special case of the more general case of a geometric automaton or a metric automaton. Its set of states is a metric space. A language is accepted by this automaton if the distance between the initial point and the set of accepted states is about this metric. Enough small. Automata are widely used in industrial production.