A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
Authors:
- Virgil-Emil CăzănescuVCVirgil-Emil Căzănescu
- Gheorghe ŞtefănescuGŞGheorghe Ştefănescu
- 1 June 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 99 (1) , 1-63
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Classes of finite relations as initial abstract data types – IIDiscrete Mathematics, 1994
- Classes of finite relations as initial abstract data types IDiscrete Mathematics, 1991
- Axiomatizing schemes and their behaviorsJournal of Computer and System Sciences, 1985
- Vector Iteration in Pointed Iterative TheoriesSIAM Journal on Computing, 1980
- Théorie des magmoïdesRAIRO. Informatique théorique, 1979
- On the algebraic structure of rooted treesJournal of Computer and System Sciences, 1978
- Théorie des magmoïdes (I)RAIRO. Informatique théorique, 1978
- Matricial theoriesJournal of Algebra, 1976
- Structured Programming With and Without go to StatementsIEEE Transactions on Software Engineering, 1976
- Adjoint machines, state-behavior machines, and dualityJournal of Pure and Applied Algebra, 1975