Geodesic
Reconfigurable finite state machines with shared memory
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 101-102 
V. N. Trenkaev. Reconfigurable finite state machines with shared memory. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 101-102. http://geodesic.mathdoc.fr/item/PDM_2010_12_a52/
@article{PDM_2010_12_a52,
     author = {V. N. Trenkaev},
     title = {Reconfigurable finite state machines with shared memory},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {101--102},
     year = {2010},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a52/}
}
TY  - JOUR
AU  - V. N. Trenkaev
TI  - Reconfigurable finite state machines with shared memory
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 101
EP  - 102
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a52/
LA  - ru
ID  - PDM_2010_12_a52
ER  - 
%0 Journal Article
%A V. N. Trenkaev
%T Reconfigurable finite state machines with shared memory
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 101-102
%N 12
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a52/
%G ru
%F PDM_2010_12_a52

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

The paper presents a structure of reconfigurable finite state machine (FSM) consisting of the output/next state logic of two basic FSMs, the control unit, and the state register. The state register is shared by two basic FSMs. One of the basic FSMs has a fixed behavior, and another – a changeable behavior. The reconfigurable FSM is proven to model the joint behavior of two basic FSMs.

[1] Sklyarov V., “Reconfigurable models of finite state machines and their implementation in FPGAs”, J. Systems Architecture, 47 (2002), 1047–1064

[2] Shidlovskii S. V., Avtomaticheskoe upravlenie. Perestraivaemye struktury, Tomskii gosudarstvennyi universitet, Tomsk, 2006, 288 pp.