Splicing semigroups of dominoes and DNA
Discrete Mathematics
Regularity of splicing languages
Discrete Applied Mathematics
Theoretical Computer Science - Special issue on universal machines and computations
Regular extended H systems are computationally universal
Journal of Automata, Languages and Combinatorics
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA splicing: computing by observing
Natural Computing: an international journal
Theoretical Computer Science
Solving SAT and HPP with accepting splicing systems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Hi-index | 0.00 |
In this paper we propose a condition for rejecting the input word by an accepting splicing system which is defined by a finite set of forbidding words. More precisely, the input word is accepted as soon as a permitting word is obtained provided that no forbidding word has been obtained so far, otherwise it is rejected. Note that in the new variant of accepting splicing system the input word can be rejected if either no permitting word is ever generated (like in [10]) or a forbidding word has been generated and no permitting word had been generated before. We investigate the computational power of the new variants of accepting splicing systems. We show that the new condition strictly increases the computational power of accepting splicing systems. Rather surprisingly, accepting splicing systems considered here can accept non-regular languages, a situation that has never occurred in the case of (extended) finite splicing systems without additional restrictions.