{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:15Z","timestamp":1725488415318},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005315"},{"type":"electronic","value":"9783540364405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36440-4_23","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T22:11:33Z","timestamp":1186438293000},"page":"262-268","source":"Crossref","is-referenced-by-count":4,"title":["Splicing Systems: Regularity and Below"],"prefix":"10.1007","author":[{"given":"Tom","family":"Head","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Pixton","sequence":"additional","affiliation":[]},{"given":"Elizabeth","family":"Goode","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,16]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"L. Adleman, Molecular computation of solutions of combinatorial problems, Science 266(1994)1021\u20131024.","journal-title":"Science"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, Singapore (1994).","DOI":"10.1142\/2481"},{"key":"23_CR3","unstructured":"P. Bonizzoni, C. De Felice, G.M auri, R. Zizza, On the power of linear and circular splicing systems, (submitted)."},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Decision problems for linear and circular splicing, DLT2002","author":"P. Bonizzoni","year":"2003","unstructured":"P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Decision problems for linear and circular splicing, DLT2002 volume of LNCS (to appear)."},{"key":"23_CR5","unstructured":"P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, The structure of reflexive splicing languages via Schutzenberger constants, (submitted)."},{"key":"23_CR6","unstructured":"K. Culik II, T. Harju, The regularity of splicing systems and DNA, in: Proc. ICALP\u2019 89, LCNS 372(1989)222\u2013233."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31(1991)261\u2013277.","journal-title":"Discrete Appl. Math."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0019-9958(80)90180-1","volume":"44","author":"A. Luca De","year":"1980","unstructured":"A. DeLuca, A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Inform. and Control 44(1980)300\u2013319.","journal-title":"Inform. and Control"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207168908803715","volume":"27","author":"K.L. Denningffho","year":"1989","unstructured":"K.L. Denningffho., R. Gatterdam, On the undecidability of splicing systems, Inter. J. Computer Math. 27(1989)133\u2013145.","journal-title":"Inter. J. Computer Math."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/00207168908803788","volume":"31","author":"R.W. Gatterdam","year":"1989","unstructured":"R.W. Gatterdam, Splicing systems and regularity, Inter. J. Computer Math. 31(1989)63\u201367.","journal-title":"Inter. J. Computer Math."},{"key":"23_CR11","volume-title":"Constants and Splicing Systems","author":"T. E. Laun","year":"1999","unstructured":"T. E. Goode Laun, Constants and Splicing Systems, Dissertation Binghamton University, Binghamton, New York(1999)."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology 49(1987)737\u2013759.","journal-title":"Bull. Math. Biology"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(98)00053-5","volume":"87","author":"T. Head","year":"1990","unstructured":"T. Head, Splicing representations of strictly locally testable languages, Discrete Appl. Math. 87(1990)139\u2013147.","journal-title":"Discrete Appl. Math."},{"key":"23_CR14","unstructured":"T. Head, Splicing languages with one-sided context, in: Gh. Paun, Ed., Biomolecular Computing \u2014 Theory and Experiment, Springer-Verlag (1998)269\u2013282."},{"key":"23_CR15","unstructured":"T.Head, Gh, Paun, D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombinations, Chapter 7, Vol.2 of: G. Rozenberg & A. Salomaa, Eds., Handbook of Formal Languages, Springer, Berlin (1997)295\u2013360."},{"key":"23_CR16","volume-title":"Where Mathematics, Computer Science, Linguistics and Biology Meet","author":"J. Kari","year":"2001","unstructured":"J. Kari, L. Kari, Context-free recombination, in: C. Martin-Vide & V. Mitrana, Eds., Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer Academic Pub., Dordrecht (2001)."},{"key":"23_CR17","unstructured":"B. Lewin, Genes, (1st.ed.) Wiley, New York (1983)."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0166-218X(98)00002-X","volume":"84","author":"A. Mateescu","year":"1996","unstructured":"A. Mateescu, Gh. Paun, G. Rozenberg, A. Salomaa, Simple splicing systems, Discrete Appl. Math. 84(1996)145\u2013163.","journal-title":"Discrete Appl. Math."},{"key":"23_CR19","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton, S. Papert, Counter-free Automata, MIT Press, Cambridge, MA (1971)."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Gh. Paun, G. Rozenberg, A. Salomaa, DNA Computing \u2014 New Computing Pardigms, Springer-Verlag, Berlin (1998).","DOI":"10.1007\/978-3-662-03563-4"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"J. E. Pin, Varieties of Formal Languages, Plenum Pub.Co. (1986).","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D. Pixton","year":"1996","unstructured":"D. Pixton, Regularity of splicing systems, Discrete Appl. Math. 69(1996)101\u2013124.","journal-title":"Discrete Appl. Math."},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhauser, Boston, MA (1994).","DOI":"10.1007\/978-1-4612-0289-9"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36440-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:55:27Z","timestamp":1556726127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36440-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005315","9783540364405"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36440-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}