Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...