{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:34:28Z","timestamp":1725824068855},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208596"},{"type":"electronic","value":"9783319208602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20860-2_4","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T04:15:57Z","timestamp":1434687357000},"page":"60-75","source":"Crossref","is-referenced-by-count":3,"title":["Reversible Ordered Restarting Automata"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kent","family":"Kwee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibiliy of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47, 149\u2013158 (1986)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","unstructured":"Ellul, K.: Descriptional complexity measures of regular languages. Master\u2019s thesis, University of Waterloo (2004)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","volume-title":"Fundamentals of Computation Theory","author":"P Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283\u2013292. Springer, Heidelberg (1995)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. System Sci. 78, 1814\u20131827 (2012)","journal-title":"J. Comput. System Sci."},{"key":"4_CR6","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Reversible queue automata. In: Bensch, S., Freund, R., Otto, F., (eds.) Proc. Sixth Workshop on Non-Classical Models of Automata and Applications \n                      \n                        \n                      \n                      $$($$\n                      \n                        \n                          (\n                        \n                      \n                    NCMA 2014\n                      \n                        \n                      \n                      $$)$$\n                      \n                        \n                          )\n                        \n                      \n                    , books@ocg.at, Band 304, pp. 163\u2013178. Oesterreichische Computer Gesellschaft, Wien (2014)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-19225-3_14","volume-title":"Descriptional Complexity of Formal Systems","author":"K Kwee","year":"2015","unstructured":"Kwee, K., Otto, F.: On some decision problems for stateless deterministic ordered restarting automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 165\u2013176. Springer, Heidelberg (2015)"},{"key":"4_CR8","first-page":"92","volume":"3","author":"E Landau","year":"1903","unstructured":"Landau, E.: \u00dcber die Maximalordnung der Permutationen gegebenen Grades. Archiv. der Math. und Phys. 3, 92\u2013103 (1903)","journal-title":"Archiv. der Math. und Phys."},{"key":"4_CR9","volume-title":"Handbuch von der Lehre der Verteilung der Primzahlen","author":"E Landau","year":"1909","unstructured":"Landau, E.: Handbuch von der Lehre der Verteilung der Primzahlen, vol. I. Teubner, Leipzig (1909)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-319-04298-5_38","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"F Mr\u00e1z","year":"2014","unstructured":"Mr\u00e1z, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 431\u2013442. Springer, Heidelberg (2014)"},{"key":"4_CR11","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-33461-3_11","volume-title":"Recent Advances in Formal Languages and Applications","author":"F Otto","year":"2006","unstructured":"Otto, F.: Restarting automata. In: \u00c9sik, Z., Mart\u00edn-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269\u2013303. Springer, Heidelberg (2006)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-319-09704-6_28","volume-title":"Descriptional Complexity of Formal Systems","author":"F Otto","year":"2014","unstructured":"Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 318\u2013329. Springer, Heidelberg (2014)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN 1992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-04921-2_45","volume-title":"Language and Automata Theory and Applications","author":"D Pr\u016f\u0161a","year":"2014","unstructured":"Pr\u016f\u0161a, D.: Weight-reducing Hennie machines and their descriptional complexity. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.4064\/aa-37-1-321-331","volume":"37","author":"M Szalay","year":"1980","unstructured":"Szalay, M.: On the maximal order in \n                      \n                        \n                      \n                      $${S}_n$$\n                      \n                        \n                          \n                            S\n                            n\n                          \n                        \n                      \n                     and \n                      \n                        \n                      \n                      $${S}_n^*$$\n                      \n                        \n                          \n                            S\n                            n\n                            \u2217\n                          \n                        \n                      \n                    . Acta Arithmetica 37, 321\u2013331 (1980)","journal-title":"Acta Arithmetica"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20860-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T03:05:15Z","timestamp":1559185515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20860-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208596","9783319208602"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20860-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}