Loading…
Academic Journal
Finite state automata in the theory of algebraic program schemata
R. I. Podlovchenko
Труды Института системного программирования РАН, Vol 27, Iss 2, Pp 161-172 (2018)
Saved in:
| Title | Finite state automata in the theory of algebraic program schemata |
|---|---|
| Authors | R. I. Podlovchenko |
| Publication Year |
2018
|
| Source |
Труды Института системного программирования РАН, Vol 27, Iss 2, Pp 161-172 (2018)
|
| Description |
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 problem is decidable for a wide class of algebraic models of programs. Our decision techniques are based on the approach to the equivalence checking problem for finite state automata. The aim of this paper is to reveal this relationship.
|
| Document Type |
article
|
| Language |
English
Russian |
| Publisher Information |
Ivannikov Institute for System Programming of the Russian Academy of Sciences, 2018.
|
| Subject Terms | |
