In this paper we present a well designed method that makes use of edge information to
extract textual blocks from gray scale document images. It aims at detecting textual regions …

Completeness theory for finite partial algebras Page 1 Algebra Universalis, 29 (1992) 378 401
0002 5240/92/030378 24501.50 + 0.20/0 9 1992 BirkhS.user Verlag, Basel Completeness …

Completeness or primality for partial algebras on a finite universe A is defined in a way
similar to full algebras. A universal completeness criterion reduces to finding the complete …

Most of the results need lengthy definitions and so cannot be adequately described in the
introduction. The paper essentially describes the subalgebra systems of direct powers of …

Maximal partial clones with no finite basis Page 1 Algebra univers. 40 (1998) 453–476 0002–5240/98/040453–24
$ 1.50+0.20/0 © Birkhäuser Verlag, Basel, 1998 Maximal partial clones with no finite basis F …

Let k≥ 2 and k be ak-element set. Denote Op (k) the set of all total functions on k. We study
the set A of all partial clones C on k whose total component C∩ Op (k) is a given maximal …

A partial operation f on a finite set A is called Sheffer if the partial algebra (A, t> is complete,
ie if all partial operations on A are compositions off (or definable in terms off). In this paper …

The study of partial clones on $\mathbf {2}:=\{0, 1\} $ was initiated by RV Freivald. In his
fundamental paper published in 1966, Freivald showed, among other things, that the set of …

The completeness problem in the algebra of partial functions of finite-valued logic Page 1 THE
COMPLETENESS PROBLEM IN THE ALGEBRA OF PARTIAL FUNCTIONS OF FINITE-VALUED …

Partial clones containing all permutations Page 1 BULL. AUSTRAL. MATH. SOC. 08A55 VOL.
52 (1995) [263-278] PARTIAL CLONES CONTAINING ALL PERMUTATIONS LUCIEN HADDAD …