caa a22 4500 378882554 CHVBK 20180305123435.0 cr unu---uuuuu 161128e20031001xx s 000 0 eng 10.1515/156939203322694763 doi (NATIONALLICENCE)gruyter-10.1515/156939203322694763 Babash A. V. On special properties of a composition of automata [Elektronische Daten] [A. V. Babash] 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. Copyright 2003, Walter de Gruyter Discrete Mathematics and Applications Walter de Gruyter 13/5(2003-10-01), 497-506 0924-9265 13:5<497 2003 13 dma https://doi.org/10.1515/156939203322694763 text/html Onlinezugriff via DOI 1 research article jats NATIONALLICENCE 856 40 https://doi.org/10.1515/156939203322694763 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Babash A. V. NATIONALLICENCE 773 0- Discrete Mathematics and Applications Walter de Gruyter 13/5(2003-10-01), 497-506 0924-9265 13:5<497 2003 13 dma CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-gruyter