{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:48:11Z","timestamp":1725702491696},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642338595"},{"type":"electronic","value":"9783642338601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33860-1_11","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T22:44:30Z","timestamp":1348699470000},"page":"121-132","source":"Crossref","is-referenced-by-count":0,"title":["An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words"],"prefix":"10.1007","author":[{"given":"Michelangelo","family":"Cianciulli","sequence":"first","affiliation":[]},{"given":"Rocco","family":"Zaccagnino","sequence":"additional","affiliation":[]},{"given":"Rosalba","family":"Zizza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.tcs.2006.01.043","volume":"356","author":"M.P. B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.P., Perrin, D.: Codes, unambiguous automata and sofic systems. Theor. Comput. Sci.\u00a0356(1-2), 6\u201313 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, Encyclopedia od Mathematics and its Applications, vol.\u00a0129. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195768"},{"key":"11_CR3","unstructured":"Colcombet, T.: Forms of determinism for automata. In: STACS 2012. pp. 1\u201323 (2012) (invited talk)"},{"key":"11_CR4","unstructured":"D\u2019Auria, L., Zizza, R.: A note on the McCloskey\u2019s algorithm for deciding whether a regular language is a code. In: ICTCS 2010, Camerino, Italy (2010)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Head, T., Weber, A.: Deciding code related properties by means of finite transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II, pp. 260\u2013272. Springer (1993)","DOI":"10.1007\/978-1-4613-9323-8_19"},{"key":"11_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/S0304-3975(02)00069-5","volume":"290","author":"S. Hussini","year":"2003","unstructured":"Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theor. Comput. Sci.\u00a0290(3), 1557\u20131579 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24628-2_8","volume-title":"DNA Computing","author":"N. Jonoska","year":"2004","unstructured":"Jonoska, N., Mahalingam, K.: Languages of DNA Based Code Words. In: Chen, J., Reif, J.H. (eds.) DNA 9. LNCS, vol.\u00a02943, pp. 61\u201373. Springer, Heidelberg (2004)"},{"key":"11_CR9","unstructured":"Kephart, D.E., LeFevre, J.: CODEGEN: The generation and testing of DNA code words. In: IEEE Congress on Evolutionary Computation (2004)"},{"issue":"10","key":"11_CR10","first-page":"79","volume":"2","author":"R. McCloskey","year":"1996","unstructured":"McCloskey, R.: An O(n\n                  2) time algorithm for deciding whether a regular language is a code. Journal of Computing and Information\u00a02(10), 79\u201389 (1996), updated version downloaded \n                    \n                      http:\/\/www.cs.uofs.edu\/~mccloske\/publications\/code_alg_header_mar2011.pdf","journal-title":"Journal of Computing and Information"},{"key":"11_CR11","unstructured":"Oprocha, P.: Fast solutions for DNA code words test. Schedae Informaticae\u00a015 (2006)"},{"key":"11_CR12","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing, new computing paradigms. Springer (1996)"},{"key":"11_CR13","first-page":"104","volume":"8","author":"A.A. Sardinas","year":"1953","unstructured":"Sardinas, A.A., Patterson, G.W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Convention Record (Pt. 8), 104\u2013108 (1953)","journal-title":"IRE Convention Record (Pt."}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33860-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:24:21Z","timestamp":1620131061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33860-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642338595","9783642338601"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33860-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}