Complexity theory for splicing systems
Remco Loos,Mitsunori Ogihara +1 more
TLDR
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 extendedsplicing systems having production time O(t( n)) with the additional property that each finite automaton appearing in the family of splice systems has at most a constant number of states.About:
This article is published in Theoretical Computer Science.The article was published on 2007-10-01 and is currently open access. It has received 6 citations till now. The article focuses on the topics: Time complexity & Pushdown automaton.read more
Citations
More filters
Book ChapterDOI
Solving SAT and HPP with accepting splicing systems
TL;DR: An accepting splicing system able to uniformly solve SAT in time O(m+n) for a formula of length m over n variables is constructed.
DNA Computing by Splicing and by Insertion-Deletion.
TL;DR: This chapter is devoted to two of the most developed theoretical computing models inspired by DNA biochemistry, computing by splicing (a formal operation with strings that models the recombination of DNA molecules under the influence of restriction enzymes and ligase) and by insertion–deletion.
Journal ArticleDOI
Time and Space Complexity for Splicing Systems
Remco Loos,Mitsunori Ogihara +1 more
TL;DR: A notion of space complexity is defined, which is based on the description size of the production tree of a word, which shows that the class of languages generated by polynomially time bounded extended regular splicing systems is exactly PSPACE.
Proceedings ArticleDOI
How Complex is to Solve a Hard Problem with Accepting Splicing Systems
TL;DR: An algorithm based on this accepting splicing system that solves a well-known NP-complete problem, namely the 3-colorability problem is presented, and an efficient solution in terms of running time and additional resources is discussed.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
Journal ArticleDOI
Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.
TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.
Journal ArticleDOI
On uniform circuit complexity
TL;DR: It is argued that uniform circuit complexity introduced by Borodin is a reasonable model of parallel complexity and that context-free language recognition is in NC, the class of polynomial size andPolynomial-in-log depth circuits.