A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complexity Theory for Splicing Systems
[chapter]
Lecture Notes in Computer Science
This paper proposes a notion of time complexity in splicing systems. The time complexity of a splicing system at length n is defined to be the smallest integer t such that all the words of the system having length n are produced within t rounds. For a function t from the set of natural numbers to itself, the class of languages with splicing system time complexity t (n) is denoted by SPLTIME[ f (n)]. This paper presents fundamental properties of SPLTIME and explores its relation to classes based
doi:10.1007/978-3-540-73208-2_29
fatcat:csus5xf2erdtjogroc5oy3moke