On special properties of a composition of automata
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378882554 | ||
| 003 | CHVBK | ||
| 005 | 20180305123435.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20031001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/156939203322694763 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/156939203322694763 | ||
| 100 | 1 | |a Babash |D A. V. | |
| 245 | 1 | 0 | |a On special properties of a composition of automata |h [Elektronische Daten] |c [A. V. Babash] |
| 520 | 3 | |a 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. | |
| 540 | |a Copyright 2003, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/5(2003-10-01), 497-506 |x 0924-9265 |q 13:5<497 |1 2003 |2 13 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/156939203322694763 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/156939203322694763 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Babash |D A. V. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/5(2003-10-01), 497-506 |x 0924-9265 |q 13:5<497 |1 2003 |2 13 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||