Mihai Prunescu

  • Citations Per Year
Learn More
For an arbitrary finite algebra (A, f(·, ·), 0, 1) one defines a double sequence a(i, j) by a(i, 0) = a(0, j) = 1 and a(i, j) = f(a(i, j − 1), a(i − 1, j)). The problem if such recurrent double sequences are ultimately zero is undecidable, even if we restrict it to the class of commutative finite algebras. A.M.S.-Classification: 03D10.
The author used the automatic proof procedure introduced in [16] and verified that the 4096 homomorphic recurrent double sequences with constant borders defined over Klein’s Vierergruppe K and the 4096 linear recurrent double sequences with constant border defined over the matrix ring M2(F2) can be also produced by systems of substitutions with finitely(More)