Title :
Rectangular algebras
Author :
Pöschel, R. ; Reichel, M.
Author_Institution :
Inst. fur Algebra, Tech. Univ., Dresden, Germany
Abstract :
Algebras of the variety RAτ generated by projection algebras (of type τ) are called rectangular algebras. It turns out that an algebra (A; F) is rectangular if and only if A can be decomposed in (i.e., encoded by) components in such a way that every term function f:An→A can be performed in parallel and is a projection on each component (algebraically speaking, if <A; F> is isomorphic to a direct product of projection algebras). A list Στ of identities that completely characterize rectangular algebras is given. Every term in RAτ has a normal form. Some algorithms (for decomposition and normal form) and examples for finite algebras of finite type are given
Keywords :
Boolean algebra; encoding; finite algebras; projection algebras; rectangular algebras; term function; Algebra; Decoding; Electronic circuits; Encoding; Shift registers;
Conference_Titel :
Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on
Conference_Location :
Sendai
Print_ISBN :
0-8186-2680-1
DOI :
10.1109/ISMVL.1992.186804