{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:58:46Z","timestamp":1780743526779,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032026019","type":"print"},{"value":"9783032026026","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-02602-6_22","type":"book-chapter","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:33:49Z","timestamp":1755851629000},"page":"316-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hierarchy of\u00a0Reversible Finite Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0380-0473","authenticated-orcid":false,"given":"Maria","family":"Radionova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,23]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741\u2013765 (1982). https:\/\/doi.org\/10.1145\/322326.322334","journal-title":"J. ACM"},{"issue":"10","key":"22_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ipl.2010.03.008","volume":"110","author":"M Balcerzak","year":"2010","unstructured":"Balcerzak, M., Niwi\u0144ski, D.: Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal. Inf. Process. Lett. 110(10), 396\u2013398 (2010). https:\/\/doi.org\/10.1016\/j.ipl.2010.03.008","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"22_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(98)00225-4","volume":"242","author":"J-C Birget","year":"2000","unstructured":"Birget, J.-C., Margolis, S.W., Meakin, J.C., Weil, P.: PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theoret. Comput. Sci. 242(1\u20132), 247\u2013281 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00225-4","journal-title":"Theoret. Comput. Sci."},{"issue":"3\u20134","key":"22_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1142\/S0129054122410052","volume":"33","author":"B Guillon","year":"2022","unstructured":"Guillon, B., Lavado, G.J., Pighizzini, G., Prigioniero, L.: Weakly and strongly irreversible regular languages. Int. J. Found. Comput. Sci. 33(3\u20134), 263\u2013284 (2022). https:\/\/doi.org\/10.1142\/S0129054122410052","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1051\/ita:2000120","volume":"34","author":"P-C H\u00e9am","year":"2000","unstructured":"H\u00e9am, P.-C.: A lower bound for reversible automata. RAIRO Theoret. Inform. App. 34(5), 331\u2013341 (2000). https:\/\/doi.org\/10.1051\/ita:2000120","journal-title":"RAIRO Theoret. Inform. App."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1142\/S0129054116400050","volume":"27","author":"M Holzer","year":"2016","unstructured":"Holzer, M., Jakobi, S.: Minimal and hyper-minimal biautomata. Int. J. Found. Comput. Sci. 27(2), 161\u2013186 (2016). https:\/\/doi.org\/10.1142\/S0129054116400050","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054118400063","volume":"29","author":"M Holzer","year":"2018","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. Int. J. Found. Comput. Sci. 29(2), 251\u2013270 (2018). https:\/\/doi.org\/10.1142\/S0129054118400063","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.25596\/jalc-2001-453","volume":"6","author":"M Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J. Autom. Lang. Comb. 6(4), 453\u2013466 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-453","journal-title":"J. Autom. Lang. Comb."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-48516-0_10","volume-title":"Developments in Language Theory","author":"M Hospod\u00e1r","year":"2020","unstructured":"Hospod\u00e1r, M., Mlyn\u00e1r\u010dik, P.: Operations on permutation automata. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 122\u2013136. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_10"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Jecker, I., Mazzocchi, N., Wolf, P.: Decomposing permutation automata. In: CONCUR 2021, LIPIcs, vol. 203, pp. 18:1\u201318:19 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.18","DOI":"10.4230\/LIPIcs.CONCUR.2021.18"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997), pp. 66\u201375. IEEE (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646094","DOI":"10.1109\/SFCS.1997.646094"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2016.11.006","volume":"682","author":"M Kutrib","year":"2017","unstructured":"Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. Theoret. Comput. Sci. 682, 149\u2013164 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.11.006","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). https:\/\/doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"issue":"1\u20133","key":"22_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.25596\/jalc-2017-145","volume":"22","author":"GJ Lavado","year":"2017","unstructured":"Lavado, G.J., Pighizzini, G., Prigioniero, L.: Minimal and reduced reversible automata. J. Autom. Lang. Comb. 22(1\u20133), 145\u2013168 (2017). https:\/\/doi.org\/10.25596\/jalc-2017-145","journal-title":"J. Autom. Lang. Comb."},{"issue":"6\u20137","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1142\/S0129054119400331","volume":"30","author":"GJ Lavado","year":"2019","unstructured":"Lavado, G.J., Prigioniero, L.: Concise representations of reversible automata. Int. J. Found. Comput. Sci. 30(6\u20137), 1157\u20131175 (2019). https:\/\/doi.org\/10.1142\/S0129054119400331","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114489","volume":"995","author":"A Okhotin","year":"2024","unstructured":"Okhotin, A., Radionova, M., Sazhneva, E.: GF(2)-operations on basic families of formal languages. Theoret. Comput. Sci. 995, 114489 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114489","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Pin, J.-\u00c9.: On the languages accepted by finite reversible automata. In: Ottmann, T. (ed.) Automata, Languages and Programming. ICALP 1987. LNCS, vol. 267, pp. 237\u2013249. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18088-5_19","DOI":"10.1007\/3-540-18088-5_19"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BFb0023844"},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Radionova, M., Okhotin, A.: Sweeping permutation automata. In: Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023, Famagusta, North Cyprus, 18\u201319 September 2023), EPTCS, vol. 388, pp. 110\u2013124 (2023). https:\/\/doi.org\/10.4204\/EPTCS.388.11","DOI":"10.4204\/EPTCS.388.11"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Radionova, M., Okhotin, A.: Decision problems for reversible and permutation automata. In: Fazekas, S.Z. (ed.) Implementation and Application of Automata. CIAA 2024. LNCS, vol. 15015, pp. 302\u2013315. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71112-1_22","DOI":"10.1007\/978-3-031-71112-1_22"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1051\/ita\/2023010","volume":"57","author":"C Rauch","year":"2023","unstructured":"Rauch, C., Holzer, M.: On the accepting state complexity of operations on permutation automata. RAIRO Theoret. Inform. App. 57, 9 (2023). https:\/\/doi.org\/10.1051\/ita\/2023010","journal-title":"RAIRO Theoret. Inform. App."},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"JC Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198\u2013200 (1959). https:\/\/doi.org\/10.1147\/rd.32.0198","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","volume":"21","author":"M Sipser","year":"1980","unstructured":"Sipser, M.: Lower bounds on the size of sweeping automata. J. Comput. Syst. Sci. 21(2), 195\u2013202 (1980). https:\/\/doi.org\/10.1016\/0022-0000(80)90034-3","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01691347","volume":"2","author":"G Thierrin","year":"1968","unstructured":"Thierrin, G.: Permutation automata. Math. Syst. Theory 2(1), 83\u201390 (1968). https:\/\/doi.org\/10.1007\/BF01691347","journal-title":"Math. Syst. Theory"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02602-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T03:23:04Z","timestamp":1779506584000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02602-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,23]]},"ISBN":["9783032026019","9783032026026"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02602-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,23]]},"assertion":[{"value":"23 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2025.unipa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}