A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
Reads0
Chats0
TLDR
The aim of this paper is to present a general result on abstract flowchart schemes and to apply it to the study of accessibility, reduction and minimization.About:
This article is published in Theoretical Computer Science.The article was published on 1992-06-01 and is currently open access. It has received 19 citations till now. The article focuses on the topics: Flowchart & Nondeterministic algorithm.read more
Citations
More filters
Journal ArticleDOI
Graph rewriting for the π-calculus
TL;DR: A graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph, which allows the use of standard graph rewriting mechanisms for modelling the reduction semantics of the calculus.
Journal ArticleDOI
Traced premonoidal categories
Nick Benton,Martin Hyland +1 more
TL;DR: It is shown that in a Freyd category, the notion of trace to symmetric premonoidal categories and of Conway operators to Freyd categories are equivalent, generalizing a well-known theorem relating traces and Conway operators in Cartesian categories.
Book ChapterDOI
Term Graph Rewriting for the π -Calculus
TL;DR: A graphical implementation for (possibly) recursive processes of the π-calculus, encoding each process into a term graph, which allows for using standard graph rewriting mechanisms in modelling the reduction semantics of the calculus.
Journal ArticleDOI
Comparing logics for rewriting
Fabio Gadducci,Ugo Montanari +1 more
TL;DR: The aim of the paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems, to find out a common layout where these logics can be recast.
References
More filters
Book
Categories for the Working Mathematician
TL;DR: In this article, the authors present a table of abstractions for categories, including Axioms for Categories, Functors, Natural Transformations, and Adjoints for Preorders.
Book ChapterDOI
Monadic Computation And Iterative Algebraic Theories
TL;DR: The notion of algebraic theory was introduced by Lawvere in 1963 as discussed by the authors to study equationally definable classes of algebras from a more intrinsic point of view and make use of it to study Turing machines and machines with a similar kind of control at a level of abstraction which disregards the nature of "storage" or "external memory".
Book ChapterDOI
On the algebraic structure of rooted trees
TL;DR: In this article, the two digraphs, while different, usually represent the same phenomenon, say, the same computational process, and the unfolding (i.e., the trees) are surrogates for the phenomena.
Journal ArticleDOI
Adjoint machines, state-behavior machines, and duality☆
Michael A. Arbib,Ernest G. Manes +1 more
TL;DR: In this article, a minimal realization theory using image factorization of a total response map is given for adjointness and duality for state-behavior machines and adjoint machines.
Journal Article
On the Algebraic Atructure of Rooted Trees.
TL;DR: The interest in rooted trees stems from the fact that these two digraphs “unfold” into the SAME infinite tree.
Related Papers (5)
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
Andrea Corradini,Fabio Gadducci +1 more