Algorithmic decidability of the Church-Rosser property in algebras of nondeterminate algorithms with closed logical conditions

DOI10.1007/BF01068977MaRDI QIDQ3964009zbMATH OpenOpenAlexFDO

Authors Yu. A. Yushchenko

Publication date 1981

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01068977

zbMATH Keywords

algebra of conditionsalgebra of operatorsalgorithmic algebranondeterminate regular schemas with closed logical conditionstransducers

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Structure theory of algebraic structures (08A05) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99)

Cites work

• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(2)

• Identical transformations in algebras of nondeterministic algorithms. I
• Analysis and synthesis of structured parallel programs

This page was built for publication: Algorithmic decidability of the Church-Rosser property in algebras of nondeterminate algorithms with closed logical conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964009)