SpringerLink

Lecture Notes in Computer Science, 2001, Volume 2138/2001, 408-411, DOI: 10.1007/3-540-44669-9_44

On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + )

Bella V. Rozenblat

View Related Documents

Abstract

Let H 3 ≃ ( Z 3; + ) be the three-element group {a,a 2,e} with a 3 = e; N 0=N∪{0}; L <·> - the class of all first-order formulas of the signature <·>. For any recursively enumerable (r.e.) set KN we effectively define an N 0 × N 0-matrix P k over H 3 and consider the Rees matrix semigroup C K = M(H 3, N 0, N 0, P K). The following theorem presents the main result of the paper.

Fulltext Preview

Image of the first page of the fulltext document