What is a poor automaton

Non-formalized definition of a poor automaton

Non-formal definition, that is, the definition of non-mathematical language.

A self-motive is an abstract machine, which has a number of States, expressed in circles. There are arrows between state and state, and the arrows have the required conditions,

That is, you can go from one state to another only if you meet the conditions on the arrows. The purpose of the state is to remember the relevant parts of the system history, that is to remember the

The input string satisfies the conditions of the automaton system, which is what is said to remember history. And being poor means that the state of this automaton is limited,

So that it can be programmed to implement it. Here is a simple and poor automaton that scans the given string to determine if it contains a string then.

Formal definition of a poor automaton

There are poor automata are divided into: ① deterministic type has poor automatic machine ② uncertain type has poor automata

There are poor automata to determine whether or not, just because their transfer function is defined differently.

Definition of a poor automaton:

1. A set of states with a poor state, usually written as V. State is not a non-terminating state $v_{n}$ and terminating state $v_{t}$

2. An alphabetical list of input symbols with poor entry. Usually written as $\sum$.

3. A transfer function that returns a state with a state and an input symbol as a variable. Usually remember to do $\delta$.

If there is an arrow from State p to status Q with a weighted value of a, then $\delta (p,a) =q$

4. An initialization state, which is also an entry. Usually written as $s$, $S \in v_{n}$

5. A set of end states $v_{t}$.

Definition of a non-deterministic machine with poor automata:

1. A set of states with a poor state, usually written as V. State is not a non-terminating state $v_{n}$ and terminating state $v_{t}$

2. An alphabetical list of input symbols with poor entry. Usually written as $\sum$.

3. A transfer function, which takes a state and an input symbol as a variable, the number of returned states is no longer one, and possibly multiple.

4. An initialization state, which is also an entry. Usually written as $s$, $S \in v_{n}$

5. A set of end states $v_{t}$.

What is a poor automaton