{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:45Z","timestamp":1725491445511},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_13","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"108-119","source":"Crossref","is-referenced-by-count":2,"title":["Hairpin Finite Automata"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-540-30550-7_9","volume-title":"Developments in Language Theory","author":"H. Bordihn","year":"2004","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata\u2014a new characterization of Khabbaz geometric hierarchy of languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 102\u2013113. Springer, Heidelberg (2004)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/11505877_15","volume-title":"Developments in Language Theory","author":"H. Bordihn","year":"2005","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Revolving-input finite automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 168\u2013179. Springer, Heidelberg (2005)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M. Daley","year":"2003","unstructured":"Daley, M., Ibarra, O., Kari, L.: Closure properties and decision questions of some language classes under ciliate bio-operations. Theoretical Computer Science\u00a0306, 19\u201338 (2003)","journal-title":"Theoretical Computer Science"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2004.03.043","volume":"320","author":"M. Daley","year":"2004","unstructured":"Daley, M., Kari, L., McQuillan, I.: Families of languages defined by ciliate bio-operations. Theoretical Computer Science\u00a0320, 51\u201369 (2004)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1142\/S0129054105003212","volume":"16","author":"J. Dassow","year":"2005","unstructured":"Dassow, J., Holzer, M.: Language families defined by a ciliate bio-operation: Hierarchies and decision problems. International Journal of Foundations of Computer Science\u00a016, 645\u2013662 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0304-3975(01)00096-2","volume":"270","author":"J. Dassow","year":"2002","unstructured":"Dassow, J., Mitrana, V., Salomaa, A.: Operations and language generating devices suggested by genome evolution. Theoretical Computer Science\u00a0270, 701\u2013738 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/FI-1998-36234","volume":"36","author":"J. Dassow","year":"1998","unstructured":"Dassow, J., P\u0103un, G.: Remarks on operations suggested by mutations in genomes. Fundamenta Informaticae\u00a036, 183\u2013200 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR9","first-page":"45","volume-title":"Evolution as Computation","author":"A. Ehrenfeucht","year":"2001","unstructured":"Ehrenfeucht, A., Prescott, D.M., Rozenberg, G.: Computational aspects of gene (un)scrambling in ciliates. In: Landweber, L.F., Winfree, E. (eds.) Evolution as Computation, pp. 45\u201386. Springer, Heidelberg (2001)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/3-540-45061-0_40","volume-title":"Automata, Languages and Programming","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Flip-pushdown automata: k\u2009+\u20091 pushdown reversals are better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 490\u2013501. Springer, Heidelberg (2003)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kari, L., Landweber, L.F.: Computational power of gene rearrangement. In: Winfree, E., Gifford, D. (eds.) DNA Based Computers V, DIMACS 54, pp. 207\u2013216 (2000)","DOI":"10.1090\/dimacs\/054\/17"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/bies.950140505","volume":"14","author":"D.M. Prescott","year":"1992","unstructured":"Prescott, D.M.: Cutting, slicing, reordering, and elimination of DNA sequences in hypotrichous ciliates. BioEssays\u00a014, 317\u2013324 (1992)","journal-title":"BioEssays"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1038\/35042057","volume":"1","author":"D.M. Prescott","year":"2000","unstructured":"Prescott, D.M.: Genome gymnastics: Unique modes of DNA evolution and processing in ciliates. Nature Review Genetics\u00a01, 191\u2013198 (2000)","journal-title":"Nature Review Genetics"},{"key":"13_CR14","unstructured":"Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report TR01-081, Electronic Colloquium on Computational Complexity (ECCC) (November 2001)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:27Z","timestamp":1605762747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}