11 search results - page 2 / 3 » Universal Recursively Enumerable Sets of Strings |
STRINGOLOGY
2004
13 years 6 months ago
2004
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...
IPL
2006
13 years 5 months ago
2006
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...
MCU
1998
13 years 6 months ago
1998
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...
FSS
2008
13 years 5 months ago
2008
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...
STACS
2009
Springer
14 years 3 days ago
2009
Springer
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...