Synthesis of computer programs that implement finite automata
Dmitry I. Cheremisinov · Automatic Control and Computer Sciences · 2007
The problem of constructing a computer program that implements finite automata is considered and possible methods of solution are discussed. The proposed method of synthesis is based on the use of the descriptive structure of an automaton. The approach is itself based on an interpretation of languages for the description of automata as programming languages. For this purpose, virtual machines of well-known automaton description languages are described. The advantage of the approach lies in the possibility for automation of the transformation: model—algorithm—program.