A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization

DOI10.1016/0304-3975(92)90171-BzbMath0770.68037OpenAlexW1970645772MaRDI QIDQ1193888

Gheorghe Ştefănescu, Virgil Emil Căzănescu

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90171-b

zbMATH Keywords

accessibilityreductionminimizationabstract flowchart scheme

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

The equational logic of fixed points, Categorical rewriting of term-like structures, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, On GS-Monoidal Theories for Graphs with Nesting, Traced Premonoidal Categories, GS·Λ Theories, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

Cites Work

• On flowchart theories. I. The deterministic case
• On flowchart theories. II: The nondeterministic case
• Classes of finite relations as initial abstract data types. I
• Adjoint machines, state-behavior machines, and duality
• Matricial theories
• On the algebraic structure of rooted trees
• Axiomatizing schemes and their behaviors
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• Equidivisible semigroups
• Vector Iteration in Pointed Iterative Theories
• Structured Programming With and Without go to Statements
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item