Descripción
|
|
---|---|
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. 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. | |
Internacional
|
Si |
ISSN o ISBN
|
978-3-642-21874-3 |
Entidad relacionada
|
Computation in Europe 2011, Models of Computation in Context, Lecture Notes in Computer Science Volume 6735 |
Nacionalidad Entidad
|
Sin nacionalidad |
Lugar del congreso
|
Sofia, Bulgaria |