Algorithmic decidability of the Church-Rosser property in algebras of nondeterminate algorithms with closed logical conditions
From MaRDI portal
Publication:3964009
DOI10.1007/BF01068977zbMath0498.68018MaRDI QIDQ3964009
Publication date: 1981
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01068977
algebra of operators; transducers; algorithmic algebra; algebra of conditions; nondeterminate regular schemas with closed logical conditions
68Q65: Abstract data types; algebraic specification
08A05: Structure theory of algebraic structures
03D99: Computability and recursion theory
68W99: Algorithms in computer science
Related Items
Identical transformations in algebras of nondeterministic algorithms. I, Analysis and synthesis of structured parallel programs
Cites Work