конечный детерминированный автомат

Geometrical images of finite state machines

Authors: Tverdokhlebov V. A.

In this work a new way of defining finite state machines (FSM) is being suggested. The discrete word geometry is built for that purpose, in which machine image is expressed as a set of lines. The methods of synthesis and analysis of geometrical images of FSMs and their features are researched. The new way of defining the FSMs allows analyzing the machine's behavior, excluding the exhausting recursive procedure of defining the initial fragments of machine functioning.

The Automata Interpretation of Integer Sequences

Authors: Epifanov A. S.

Transformation of phase pictures to geometrical images of laws of functioning of state machines, offered and developed by V.A.Tverdokhlebov , has allowed to represent phase pictures by uniform mathematical structures –- broken lines with numerical coordinates of points. V.A.Tverdokhlebov shows, that sequence of elements from the finite set, combined with linear order on set of input words, defines laws of functioning of the discrete determined dynamic system (state machine).

Morphismes Based on Compatible Tolerances of Finite Automata

Authors: Mangusheva I. P.

It is suggested a method of a construction with the help of some triple of tolerances defined on the sets of states, input and output symbols of an finite definite automaton an another automaton which is connected with the original automaton by a certain morphism.
Considered construction generalizes the known method of finding of the homomorphic images of an automaton with the help of a triple of equivalences, which satisfies to the certain conditions.

Ordered automata and tolerant images of FDA

Authors: Mangusheva I. P.

Finite deterministic automaton (FDA) with partially ordered (an ordered automaton) sets of states, input and output symbols is described in the article. The mapping of FDA on an ordered automaton, which is named "p-morphism" is defined. It is shown that so called tolerant images, which are constructed with the help of compatible tolerances on the set of states of FDA, are particular case of ordered automata, which are connected with the original automaton by a p-morphism.