State assignment in a~discrete automaton targeting an implementing low power circuit
Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 62-71

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of the state assignment in a discrete automaton aimed to decrease the switching activity of memory elements in an implementing circuit is considered. A method for solving this problem based on an approach connected with the “desirable neighborhood” method is proposed.
Keywords: discrete automaton, state assignment.
@article{PDM_2011_4_a7,
     author = {Yu. V. Pottosin},
     title = {State assignment in a~discrete automaton targeting an implementing low power circuit},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {62--71},
     publisher = {mathdoc},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/}
}
TY  - JOUR
AU  - Yu. V. Pottosin
TI  - State assignment in a~discrete automaton targeting an implementing low power circuit
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 62
EP  - 71
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/
LA  - ru
ID  - PDM_2011_4_a7
ER  - 
%0 Journal Article
%A Yu. V. Pottosin
%T State assignment in a~discrete automaton targeting an implementing low power circuit
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 62-71
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/
%G ru
%F PDM_2011_4_a7
Yu. V. Pottosin. State assignment in a~discrete automaton targeting an implementing low power circuit. Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 62-71. http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/