On the properties of a special composition of automata

A. V. Babash


Abstract: We suggest algorithms for constructing models of a finite automaton which are new automata such that the equations describing the functioning of these models are consequences of the equations describing the functioning of the initial automaton. These new automata are constructed with the use of powers of the initial automaton and some additional functions on the output words. Applications of the results are related to the problem on determining the state of an automaton on the base of the input sequences and the corresponding output sequences.

UDC: 519.7

Received: 10.07.2002

DOI: 10.4213/dm206

 English version: Discrete Mathematics and Applications, 2003, 13:5, 497–506

Bibliographic databases:

• 
•