A language L is called thin if for almost all n there is at most one word of length n in L. A language L is called slender if there is a positive inte...
We introduce the sticker systems, a computability model, which is an ion of the computations using the Watson-Crick complementarity as in Adleman's DN...
The use of a so-called concept lattice for deriving concepts from a given set of entities and attributes is examined. A number of variations are discu...
The list-ranking problem is considered for parallel computers which communicate through an interconnection network. The algorithms are based on the id...
We consider language structures L('Sigma' ) = (P('Sigma' ),., x , +, 1, 0), where P('Sigma' ) consists of all subsets of the free monoid 'Sigma' (*);...
