{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:55Z","timestamp":1725491455227},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_29","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T03:58:11Z","timestamp":1189569491000},"page":"300-311","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Theory for Splicing Systems"],"prefix":"10.1007","author":[{"given":"Remco","family":"Loos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0022-0000(71)80025-9","volume":"5","author":"R.V. Book","year":"1971","unstructured":"Book, R.V.: Time-bounded grammars and their languages. Journal of Computer and System Sciences\u00a05(4), 397\u2013429 (1971)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics\u00a031, 261\u2013277 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"5-6","key":"29_CR3","first-page":"29","volume":"3","author":"A.V. [ERROR while converting LaTeX\/Unico","year":"1964","unstructured":"Gladki\u012d, A.V.: On the complexity of derivations in phase-structure grammars. Algebra i Logika Seminar\u00a03(5-6), 29\u201344 (1964) (in Russian)","journal-title":"Algebra i Logika Seminar"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology\u00a049, 737\u2013759 (1987)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/0210027","volume":"10","author":"J. Hartmanis","year":"1981","unstructured":"Hartmanis, J., Mahaney, S.R.: Languages simultaneously complete for one-way and two-way log-tape automata. SIAM Journal of Computing\u00a010(2), 383\u2013390 (1981)","journal-title":"SIAM Journal of Computing"},{"key":"29_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA (1979)"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01683260","volume":"10","author":"R.E. Ladner","year":"1976","unstructured":"Ladner, R.E., Lynch, N.A.: Relativization of questions about logspace computability. Mathematical Systems Theory\u00a010(1), 19\u201332 (1976)","journal-title":"Mathematical Systems Theory"},{"key":"29_CR8","first-page":"1817","volume-title":"Relating the minimum model for DNA computation and Boolean circuits","author":"M. Ogihara","year":"1999","unstructured":"Ogihara, M.: Relating the minimum model for DNA computation and Boolean circuits. Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pp. 1817\u20131821. Morgan Kaufmann Publishers, San Francisco, CA (1999)"},{"key":"29_CR9","first-page":"309","volume-title":"Unconventional Models of Computation","author":"M. Ogihara","year":"1998","unstructured":"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\u2013322. Springer, Heidelberg (1998)"},{"key":"29_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, MA (1994)"},{"issue":"1","key":"29_CR11","first-page":"27","volume":"1","author":"G.. P\u0103un","year":"1996","unstructured":"P\u0103un, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages, Combinatorics\u00a01(1), 27\u201336 (1996)","journal-title":"Journal of Automata, Languages, Combinatorics"},{"issue":"2","key":"29_CR12","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0304-3975(96)00082-5","volume":"168","author":"G. P\u0103un","year":"1996","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: Computing by splicing. Theoretical Computer Science\u00a0168(2), 32\u2013336 (1996)","journal-title":"Theoretical Computer Science"},{"key":"29_CR13","volume-title":"DNA Computing - New Computing Paradigms","author":"G.. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing - New Computing Paradigms. Springer-Verlag, Berlin Heidelberg (1998)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D. Pixton","year":"1996","unstructured":"Pixton, D.: Regularity of splicing languages. Discrete Applied Mathematics\u00a069, 101\u2013124 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR15","first-page":"213","volume-title":"Parallel molecular computation","author":"J.H. Reif","year":"1995","unstructured":"Reif, J.H.: Parallel molecular computation. Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architecture, pp. 213\u2013223. ACM Press, New York (1995)"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. Ruzzo","year":"1981","unstructured":"Ruzzo, W.: On uniform circuit complexity. Journal of Computer and System Sciences\u00a022, 365\u2013383 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","volume":"43","author":"H. Venkateswaran","year":"1991","unstructured":"Venkateswaran, H.: Properties that characterize LOGCFL. Journal of Computer and System Sciences\u00a043, 380\u2013404 (1991)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:05:35Z","timestamp":1619503535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}