Semantics of flowchart programs and the free conway theories

L. Bernátsky, Z. Ésik

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Several useful identities involving the fixed point or iteration operation are consequences of just the Conway theory axioms. In this paper we give several characterizations of the free Conway theories including a concrete description based on "aperiodic" homomorphisms of flowchart schemes. It follows from this concrete description that the equations that hold in Conway theories are exactly the valid "group-free" equations of iteration theories, moreover, the equational theory of Conway theories is PSPACE-complete.

Original languageEnglish
Pages (from-to)35-78
Number of pages44
JournalTheoretical Informatics and Applications
Volume32
Issue number1-3
Publication statusPublished - Jan 1998

Fingerprint

Semantics
Iteration
Equational Theory
Free Group
Homomorphisms
Axioms
Fixed point
Valid

ASJC Scopus subject areas

  • Information Systems

Cite this

Semantics of flowchart programs and the free conway theories. / Bernátsky, L.; Ésik, Z.

In: Theoretical Informatics and Applications, Vol. 32, No. 1-3, 01.1998, p. 35-78.

Research output: Contribution to journalArticle

@article{836a3b0af67940f2998e0ddd6c2ff788,
title = "Semantics of flowchart programs and the free conway theories",
abstract = "Several useful identities involving the fixed point or iteration operation are consequences of just the Conway theory axioms. In this paper we give several characterizations of the free Conway theories including a concrete description based on {"}aperiodic{"} homomorphisms of flowchart schemes. It follows from this concrete description that the equations that hold in Conway theories are exactly the valid {"}group-free{"} equations of iteration theories, moreover, the equational theory of Conway theories is PSPACE-complete.",
author = "L. Bern{\'a}tsky and Z. {\'E}sik",
year = "1998",
month = "1",
language = "English",
volume = "32",
pages = "35--78",
journal = "RAIRO - Theoretical Informatics and Applications",
issn = "0988-3754",
publisher = "EDP Sciences",
number = "1-3",

}

TY - JOUR

T1 - Semantics of flowchart programs and the free conway theories

AU - Bernátsky, L.

AU - Ésik, Z.

PY - 1998/1

Y1 - 1998/1

N2 - Several useful identities involving the fixed point or iteration operation are consequences of just the Conway theory axioms. In this paper we give several characterizations of the free Conway theories including a concrete description based on "aperiodic" homomorphisms of flowchart schemes. It follows from this concrete description that the equations that hold in Conway theories are exactly the valid "group-free" equations of iteration theories, moreover, the equational theory of Conway theories is PSPACE-complete.

AB - Several useful identities involving the fixed point or iteration operation are consequences of just the Conway theory axioms. In this paper we give several characterizations of the free Conway theories including a concrete description based on "aperiodic" homomorphisms of flowchart schemes. It follows from this concrete description that the equations that hold in Conway theories are exactly the valid "group-free" equations of iteration theories, moreover, the equational theory of Conway theories is PSPACE-complete.

UR - http://www.scopus.com/inward/record.url?scp=0032387177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032387177&partnerID=8YFLogxK

M3 - Article

VL - 32

SP - 35

EP - 78

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

IS - 1-3

ER -