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

DOI10.1007/BF01068977zbMath0498.68018OpenAlexW2065174985MaRDI QIDQ3964009

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 operatorstransducersalgorithmic algebraalgebra of conditionsnondeterminate regular schemas with closed logical conditions

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Tree-Manipulating Systems and Church-Rosser Theorems

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