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.

UDC: 519.713