{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:34Z","timestamp":1725492814756},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540420767"},{"type":"electronic","value":"9783540449928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44992-2_5","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:35:31Z","timestamp":1192890931000},"page":"53-62","source":"Crossref","is-referenced-by-count":7,"title":["About time-varying distributed H systems"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Margenstern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yurii","family":"Rogozhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"5_CR1","first-page":"211","volume":"2-3","author":"E. Csuhaj-Varj\u00f9","year":"1996","unstructured":"Csuhaj-Varj\u00f9, E., Kari, L., P\u0103un, G.: Test Tube distributed system based on splicing. Computer and AI. 2-3 (1996) 211\u2013232","journal-title":"Computer and AI"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0304-3975(99)00098-5","volume":"231","author":"C. Ferretti","year":"2000","unstructured":"Ferretti, C., Mauri, G., Zandron, C.: Nine test tubes generate any RE language. TCS. 231, no.2 (2000) 171\u2013180","journal-title":"TCS"},{"key":"5_CR3","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 recombinant behaviors. Bulletin of Mathematical Biology 49 (1987) 737\u2013759","journal-title":"Bulletin of Mathematical Biology"},{"key":"5_CR4","volume-title":"Handbook of Formal Languages","author":"T. Head","year":"1997","unstructured":"Head, T., P\u0103un, Gh., Pixton, D.: Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination. Chapter 7 in vol.2 of G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Heidelberg (1997)"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00102-4","volume":"231","author":"M. Margenstern","year":"2000","unstructured":"Margenstern, M.: Frontier between decidability and undecidability: a survey. TCS. 231, no.2 (2000) 217\u2013251","journal-title":"TCS"},{"key":"5_CR6","unstructured":"Margenstern, M., Rogozhin, Yu.: A universal time-varying distributed H-system of degree 2. In Preliminary proceedings, Fourth International Meeting on DNA Based Computers, June 15\u201319, 1998, University of Pennsylvania (1998) 83\u201384"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(99)00034-9","volume":"52","author":"M. Margenstern","year":"1999","unstructured":"Margenstern, M., Rogozhin, Yu.: A universal time-varying distributed H-system of degree 2. Biosystems 52 (1999) 73\u201380","journal-title":"Biosystems"},{"key":"5_CR8","unstructured":"Margenstern, M., Rogozhin, Yu.: Generating all recursively enumerable languages with a time-varying distributed H-system of degree 2. Publications du GIFM, no. 99-102, I.U.T., Metz (France), ISBN 2-9511539-5-3 (1999)"},{"key":"5_CR9","first-page":"157","volume":"67","author":"A. P\u0103un","year":"1999","unstructured":"P\u0103un, A.: On Time-Varying H Systems. Bulletin of EATCS. 67 (1999) 157\u2013164","journal-title":"Bulletin of EATCS"},{"issue":"1","key":"5_CR10","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 and Combinatorics 1, no.1 (1996) 27\u201336","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"321","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. TCS. 168, no.2 (1996) 321\u2013336","journal-title":"TCS"},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-63246-8_22","volume-title":"Structures in Logic and Computer Science. A Selection of Essays in honor of A. Ehrenfeucht","author":"G. P\u0103un","year":"1997","unstructured":"P\u0103un, G.: DNA computing: distributed splicing systems. In Structures in Logic and Computer Science. A Selection of Essays in honor of A. Ehrenfeucht, LNCS. 1261 (1997) 353\u2013370"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(99)00104-8","volume":"231","author":"G. P\u0103un","year":"2000","unstructured":"P\u0103un, G.: DNA Computing Based on Splicing: Universality Results. TCS. 231, no.2 (2000) 275\u2013296","journal-title":"TCS"},{"key":"5_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","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, Heidelberg (1998)"},{"key":"5_CR15","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. Descrete Applied Mathematics 69 (1996) 101\u2013124","journal-title":"Descrete Applied Mathematics"},{"key":"5_CR16","first-page":"545","volume-title":"Proceedings of Pacific Symposium on Biocomputing, Kapalua, Maui, January 1998","author":"L. Priese","year":"1998","unstructured":"Priese, L., Rogozhin, Yu., Margenstern, M.: Finite H-Systems with 3 Test Tubes are not Predictable. In Proceedings of Pacific Symposium on Biocomputing, Kapalua, Maui, January 1998 (R.B. Altman, A.K. Dunker, L. Hunter, T.E. Klein, eds), World Sci. Publ., Singapure (1998) 545\u2013556"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"Yu. Rogozhin","year":"1996","unstructured":"Rogozhin, Yu.: Small universal Turing machines. TCS. 168, no.2 (1996) 215\u2013240","journal-title":"TCS"},{"issue":"3","key":"5_CR18","first-page":"259","volume":"1","author":"Yu. Rogozhin","year":"1998","unstructured":"Rogozhin, Yu.: A Universal Turing Machine with 22 States and 2 Symbols. Romanian Journal of Information Science and Technology 1, no.3 (1998) 259\u2013265","journal-title":"Romanian Journal of Information Science and Technology"},{"key":"5_CR19","unstructured":"Verlan, S.: On extended time-varying distributed H systems. Poster at DNA6 conference, Leiden (2000)"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44992-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:48:05Z","timestamp":1548373685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44992-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420767","9783540449928"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44992-2_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}