Finite state automata in the theory of algebraic program schemata
Algebraic models of programs considered in this paper generalize two models of programs introduced by A.A. Lyapunov and A.A. Letichevsky. The theory of these models focuses on the equivalence checking problem for program schemata which are formalization of imperative programs. We prove that this pro...
| 第一著者: | |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| シリーズ: | Труды Института системного программирования РАН |
| 主題: | |
| オンライン･アクセス: | https://ispranproceedings.elpub.ru/jour/article/view/1096 |