{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:58:44Z","timestamp":1780743524712,"version":"3.54.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319409450","type":"print"},{"value":"9783319409467","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_2","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"15-26","source":"Crossref","is-referenced-by-count":2,"title":["The Degree of Irreversibility in Deterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Holger Bock","family":"Axelsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Axelsen, H.B., Kutrib, M., Malcher, A., Wendlandt, M.: Boosting reversible pushdown machines by preprocessing. In: RC 2016, LNCS. Springer (2016)","DOI":"10.1007\/978-3-319-40578-0_6"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"2_CR3","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-319-21500-6_22","volume-title":"Developments in Language Theory","author":"M Holzer","year":"2015","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 276\u2013287. Springer, Heidelberg (2015)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66\u201375. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-319-13350-8_7","volume-title":"Computing with New Resources","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M.: Aspects of reversibility for classical automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 83\u201398. Springer, Heidelberg (2014)"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"3","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 3, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: SWAT 1972, pp. 125\u2013129. IEEE (1972)","DOI":"10.1109\/SWAT.1972.29"},{"issue":"1","key":"2_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.tcs.2008.01.041","volume":"395","author":"K Morita","year":"2008","unstructured":"Morita, K.: Reversible computing and cellular automata\u2013a survey. Theoret. Comput. Sci. 395(1), 101\u2013131 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-319-20860-2_7","volume-title":"Reversible Computation","author":"UP Schultz","year":"2015","unstructured":"Schultz, U.P., Laursen, J.S., Ellekilde, L., Axelsen, H.B.: Towards a domain-specific language for reversible assembly sequences. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 111\u2013126. Springer, Switzerland (2015)"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T14:29:12Z","timestamp":1568125752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}