Synthesis of Computer Programs that Implement Finite Automata

被引:0
作者
Cheremisinov, D. I. [1 ]
机构
[1] Natl Acad Sci Belarus, United Inst Informat Problems, Ul Surganov 6, Minsk 220012, BELARUS
关键词
finite automaton; computer program; interpretation of languages for the description of automata;
D O I
10.3103/S0146411607040050
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:215 / 223
页数:9
相关论文
共 20 条
[1]  
Baranov S. I., 1974, SINTEZ MIKROPROGRAMM
[2]  
Blikle A., 1979, PRACE IPI PAN WARSA, V344
[3]  
Cheremisinov D. I., 1979, ALGORITMY RESHENIYA
[4]  
Ershov A. P., 1967, KIBERNETIKA
[5]  
Gavrilov M. A., 1977, LOGICHESKOE PROEKTIR
[6]  
GILL A, 1967, LINEAR SEQUENTIAL CI
[7]  
Glushkov V. M., 1971, KIBERNETIKA
[8]  
Hoare C. E. R., 1980, SEMANTIKA YAZYKOV PR
[9]  
Kotov V. E., 1978, VVEDENIE TEORIYU SKH
[10]  
Lee C.Y., 1959, BELL SYST TECH J, V38