Splicing semigroups of dominoes and DNA
Discrete Mathematics
Properties that characterize LOGCFL
Journal of Computer and System Sciences
Parallel molecular computation
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
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
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
An alternative definition of splicing
Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Non-preserving splicing with delay
International Journal of Computer Mathematics
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Hi-index | 5.23 |
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 on standard computational models, both in terms of upper bounds and in terms of lower bounds. As to upper bounds, it is shown that for any function t(n)SPLTIME[t(n)] is included in 1-NSPACE[t(n)]; i.e., the class of languages accepted by a t(n)-space-bounded non-deterministic Turing machine with one-way input head. Expanding on this result, it is shown that 1-NSPACE[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 the additional property that each finite automaton appearing in the family of splicing systems has 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(logn)] and that the context-free languages are in SPLTIME[O(n)].