|
Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 101–102
(Mi pdm231)
|
|
|
|
Applied Theory of Coding, Automata and Graphs
Reconfigurable finite state machines with shared memory
V. N. Trenkaev Tomsk State University, Tomsk
Abstract:
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.
Citation:
V. N. Trenkaev, “Reconfigurable finite state machines with shared memory”, Prikl. Diskr. Mat., 2010, supplement № 3, 101–102
Linking options:
https://www.mathnet.ru/eng/pdm231 https://www.mathnet.ru/eng/pdm/y2010/i12/p101
|
Statistics & downloads: |
Abstract page: | 171 | Full-text PDF : | 64 | References: | 36 |
|