Abstract

The paper is devoted to problems arising when applying homological algebra to computer science. It is proved that the Leech dimension of a free partially commutative monoid is equal to the least upper bound of the cardinalities of finite subsets of pairwise commuting generators of the monoid. For an arbitrary free partially commutative monoid in which every subset of pairwise commuting generators is finite and for any contravariant natural system on we construct a semicubical set with a homological system on this set such that the Leech homology groups are isomorphic to the cubical homology groups . Complexes of Abelian groups are also constructed enabling one to obtain (under additional finiteness conditions) algorithms for computing the Leech homology groups and homology groups with coefficients in right -modules.Bibliography: 16 titles.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call