{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:56Z","timestamp":1759638656450},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T00:00:00Z","timestamp":1424390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11047-015-9494-5","type":"journal-article","created":{"date-parts":[[2015,2,19]],"date-time":"2015-02-19T03:59:01Z","timestamp":1424318341000},"page":"691-699","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["State complexity of deterministic Watson\u2013Crick automata and time varying Watson\u2013Crick automata"],"prefix":"10.1007","volume":"14","author":[{"given":"Kumar Sankar","family":"Ray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kingshuk","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debayan","family":"Ganguly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,20]]},"reference":[{"key":"9494_CR1","unstructured":"Campeanu C, Santean N, Yu S (1998) Minimal cover automata for finite languages, International workshop on implementing automata, WIA 98, Rouen, 32\u201342"},{"key":"9494_CR2","doi-asserted-by":"crossref","unstructured":"Czeizler E, Czeizler E (2005) Parallel communicating Watson-Crick Automata systems, Proc. 11th International Conference AFL","DOI":"10.1016\/j.tcs.2006.01.049"},{"issue":"1","key":"9494_CR3","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tcs.2006.01.049","volume":"358","author":"E Czeizler","year":"2006","unstructured":"Czeizler E, Czeizler E (2006a) On the power of parallel communicating Watson\u2013Crick automata systems. Theor Comput Sci 358(1):142\u2013147","journal-title":"Theor Comput Sci"},{"key":"9494_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1308\/147363506X101210","volume":"88","author":"E Czeizler","year":"2006","unstructured":"Czeizler E, Czeizler E (2006b) A short survey on Watson-Crick automata. Bull EATCS 88:104\u2013119","journal-title":"Bull EATCS"},{"issue":"35","key":"9494_CR5","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1016\/j.tcs.2009.05.001","volume":"410","author":"E Czeizler","year":"2009","unstructured":"Czeizler E, Czeizler E, Kari L, Salomaa K (2009) On the descriptional complexity of Watson-Crick automata. Theor Comput Sci 410(35):3250\u20133260 28 August 2009","journal-title":"Theor Comput Sci"},{"key":"9494_CR6","doi-asserted-by":"crossref","unstructured":"Freund R, P\u0103un G, Rozenberg G, Salomaa A (1997) Watson-Crick finite automata, Proc 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, 297\u2013328","DOI":"10.1090\/dimacs\/048\/22"},{"key":"9494_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/00207168608803509","volume":"19","author":"K Krithivasan","year":"1986","unstructured":"Krithivasan K, Das A (1986) Time varying finite automata. Int J Comput Math 19:103\u2013123","journal-title":"Int J Comput Math"},{"key":"9494_CR8","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-48321-7_34","volume":"1684","author":"A P\u0103un","year":"1999","unstructured":"P\u0103un A, P\u0103un M (1999) State and transition complexity of Watson-Crick finite automata. Fundam Comput Theory Lect Notes Comput Sci 1684:409\u2013420","journal-title":"Fundam Comput Theory Lect Notes Comput Sci"},{"key":"9494_CR9","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 (1998) DNA computing: new computing paradigms. Springer-Verlag, Berlin"},{"issue":"10","key":"9494_CR10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.4236\/am.2013.410A1005","volume":"4","author":"KS Ray","year":"2013","unstructured":"Ray KS, Chatterjee K, Ganguly D (2013) Equivalence of subclasses of two-way non-deterministic Watson-Crick automata. Appl Math 4(10):26","journal-title":"Appl Math"},{"key":"9494_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"K Salomaa","year":"1994","unstructured":"Salomaa K, Yu S, Zhuang Q (1994) The state complexities of some basic operations on regular languages. Theor Comput Sci 125:315\u2013328","journal-title":"Theor Comput Sci"},{"key":"9494_CR12","doi-asserted-by":"crossref","unstructured":"Yu S (1997) Regular languages, in handbook of formal languages, vol 1, chap 2. Springer, Berlin, pp 41\u2013110","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9494-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9494-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9494-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T22:38:49Z","timestamp":1566340729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9494-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,20]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9494"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9494-5","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,20]]}}}