Software implementation of the finite state machine in C

Бесплатный доступ

A finite state machine is described by sets of input and output symbols and symbols of internal states. In addition, transition and output functions are set. The most "fast" implementation of these functions is performed in hardware. Therefore, for example, processor control devices are built based on the so-called programmable logic array (PLA). However, a "slow" software implementation is often necessary, for example, when recognizing code sequences ("pin"), checking the syntax of programs, etc. The article discusses the software implementation of the state machine by the C language using the PLA algorithm.

Finite state machine, transition function, output function, c program

Короткий адрес: https://sciup.org/147245457

IDR: 147245457   |   DOI: 10.17072/1993-0550-2019-3-86-90

Статья научная