Complexity Theory for Splicing Systems
This paper proposes a notion of time complexity in splicing systems and presents fundamental properties of SPLTIME, the class of languages with splicing system time complexity t(n). Its relations to classes based on standard computational models are explored. It is shown that for any function t(n), SPLTIME[t(n)] is included in 1NSPACE[t(n)]. Expanding on this result, 1NSPACE[t(n)] is characterized in terms of splicing systems: it is the class of languages accepted by a t(n)-space uniform family of extended splicing systems having production time O(t(n)) with regular rules described by finite automata with at most a constant number of states. As to lower bounds, it is shown that for all functions t(n) ≥ logn, all languages accepted by a pushdown automaton with maximal stack height t(|x|) for a word x are in SPLTIME[t(n)]. From this result, it follows that the regular languages are in SPLTIME[O(log(n))] and that the context-free languages are in SPLTIME[O(n)].
Unable to display preview. Download preview PDF.
- 3.Gladkiĭ, A.V.: On the complexity of derivations in phase-structure grammars. Algebra i Logika Seminar 3(5-6), 29–44 (1964) (in Russian)Google Scholar
- 8.Ogihara, M.: Relating the minimum model for DNA computation and Boolean circuits. Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pp. 1817–1821. Morgan Kaufmann Publishers, San Francisco, CA (1999)Google Scholar
- 9.Ogihara, M., Ray, A.: The minimum DNA computation model and its computational power. In: Ogihara, M., Ray, A. (eds.) Unconventional Models of Computation, Singapore, pp. 309–322. Springer, Heidelberg (1998)Google Scholar
- 12.Păun, G., Rozenberg, G., Salomaa, A.: Computing by splicing. Theoretical Computer Science 168(2), 32–336 (1996)Google Scholar
- 15.Reif, J.H.: Parallel molecular computation. Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architecture, pp. 213–223. ACM Press, New York (1995)Google Scholar