{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:05Z","timestamp":1759637585639},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664123"},{"type":"electronic","value":"9783540483212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48321-7_34","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T12:57:55Z","timestamp":1194267475000},"page":"409-420","source":"Crossref","is-referenced-by-count":4,"title":["State and transition complexity of Watson-Crick finite automata"],"prefix":"10.1007","author":[{"given":"Andrei","family":"P\u0103un","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"34_CR1","unstructured":"C. C\u00e2mpeanu, N. S\u00e2ntean, S. Yu, Minimal cover-automata for finite languages, International Workshop on Implementing Automata, WIA 98, Rouen, 1998, 32\u201342."},{"key":"34_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"J. Dassow, Gh. P\u0103un, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322203.322211","volume":"27","author":"J. Engelfriet","year":"1980","unstructured":"J. Engelfriet, G. Rozenberg, Fixed point languages, equality languages, and representations of recursively enumerable languages, Journal of the ACM, 27 (1980), 499\u2013518.","journal-title":"Journal of the ACM"},{"key":"34_CR4","unstructured":"R. Freund, Gh. P\u0103un, G. Rozenberg, A. Salomaa, Watson-Crick finite automata, Proc. of the Third Annual DIMACS Symp. on DNA Based Computers, Philadelphia, 1997, 305\u2013317."},{"key":"34_CR5","unstructured":"R. Freund, Gh. P\u0103un, G. Rozenberg, A. Salomaa, Watson-Crick automata, Technical Report 97-13, Dept. of Computer Sci., Leiden Univ., 1997."},{"key":"34_CR6","unstructured":"J. Gruska, Descriptional complexity of context-free languages, Proc. MFCS\u2019 73, High Tatras, 1973, 71\u201383."},{"issue":"4","key":"34_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00290734","volume":"19","author":"J. Hromkovic","year":"1983","unstructured":"J. Hromkovic, One-way multihead deterministic finite automata, Acta Informatica, 19, 4 (1983), 377\u2013384.","journal-title":"Acta Informatica"},{"key":"34_CR8","first-page":"193","volume":"4","author":"O. H. Ibarra","year":"1975","unstructured":"O. H. Ibarra, C. E. Kim, On 3-head versus 2-head finite automata, Inform. Control, 4 (1975), 193\u2013200.","journal-title":"Inform. Control"},{"key":"34_CR9","volume-title":"DNA Computing. New Computing Paradigms","author":"Gh. P\u0103un","year":"1998","unstructured":"Gh. P\u0103un, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Heidelberg, 1998."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1147\/rd.105.0388","volume":"10","author":"A. L. Rosenberg","year":"1966","unstructured":"A. L. Rosenberg, On multihead finite automata, IBM J. R. and D., 10 (1966), 388\u2013394.","journal-title":"IBM J. R. and D."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"34_CR11","unstructured":"G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"K. Salomaa","year":"1994","unstructured":"K. Salomaa, S. Yu, Q. Zhuang, The state complexities of some basic operations on regular languages, Theoretical Computer Sci., 125 (1994), 315\u2013328.","journal-title":"Theoretical Computer Sci."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"S. Yu, Regular languages, Chapter 2 in vol. 1 of [11], 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48321-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T05:22:12Z","timestamp":1556947332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48321-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664123","9783540483212"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48321-7_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}