Based on the algebraic characterization of reducible graphical flowcharts, recursive flowchart schemes are introduced and studied. It is shown how to obtain interpretations of recursive flowchart schemes in the same mathematically elegant way as is well known in the case of recursive tree schemes. The results directly lead to algebraic fixed point semantics of recursive flowchart schemes
AbstractIn the paper, a complete system of transformation rules preserving the tree equivalence and ...
We define a class of tree schemata and a notion of refinement between trees (finite or infinite). Th...
AbstractAn abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart ...
AbstractThe paper concerns the relationship between graph theoretic and algebraic properties of stru...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
AbstractIn this paper, we study some aspects of the semantics of nondeterministic flowchart programs...
In this paper we give new characterizations for the flowchartability of recursive functionals. Here ...
AbstractWe give a calculus for nondeterministic flowchart schemes similar to the calculus of polynom...
AbstractThe main problem in recursive scheme theory is determining how to solve a scheme and express...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
AbstractIn Part I of the paper, we have proposed a unified relational algebra approach using partial...
This paper proposes the foundation for a systematic study of the translation of recursive function d...
Abstract. We show the existence of a single interpretation for which no flowchart produces the same ...
AbstractWe give the syntax and semantics of a language for expressing recursive systems of flowgraph...
AbstractIn the second part of this work, we formulate a new inductive assertion method applying to t...
AbstractIn the paper, a complete system of transformation rules preserving the tree equivalence and ...
We define a class of tree schemata and a notion of refinement between trees (finite or infinite). Th...
AbstractAn abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart ...
AbstractThe paper concerns the relationship between graph theoretic and algebraic properties of stru...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
AbstractIn this paper, we study some aspects of the semantics of nondeterministic flowchart programs...
In this paper we give new characterizations for the flowchartability of recursive functionals. Here ...
AbstractWe give a calculus for nondeterministic flowchart schemes similar to the calculus of polynom...
AbstractThe main problem in recursive scheme theory is determining how to solve a scheme and express...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
AbstractIn Part I of the paper, we have proposed a unified relational algebra approach using partial...
This paper proposes the foundation for a systematic study of the translation of recursive function d...
Abstract. We show the existence of a single interpretation for which no flowchart produces the same ...
AbstractWe give the syntax and semantics of a language for expressing recursive systems of flowgraph...
AbstractIn the second part of this work, we formulate a new inductive assertion method applying to t...
AbstractIn the paper, a complete system of transformation rules preserving the tree equivalence and ...
We define a class of tree schemata and a notion of refinement between trees (finite or infinite). Th...
AbstractAn abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart ...
DOI
Add to ORKG