### Abstract

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 1-NSPACE[t(n)]. Expanding on this result, 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 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) > log n, 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)].

Original language | English (US) |
---|---|

Title of host publication | Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings |

Pages | 300-311 |

Number of pages | 12 |

State | Published - Aug 27 2007 |

Externally published | Yes |

Event | 11th International Conference on Developments in Language Theory, DLT 2007 - Turku, Finland Duration: Jul 3 2007 → Jul 6 2007 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 4588 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 11th International Conference on Developments in Language Theory, DLT 2007 |
---|---|

Country | Finland |

City | Turku |

Period | 7/3/07 → 7/6/07 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings*(pp. 300-311). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4588 LNCS).