{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:59:51Z","timestamp":1780743591642,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031711114","type":"print"},{"value":"9783031711121","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71112-1_22","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"302-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Decision Problems for\u00a0Reversible and\u00a0Permutation 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":[[2024,9,3]]},"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":"1\u20132","key":"22_CR2","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. Theor. Comput. Sci. 242(1\u20132), 247\u2013281 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00225-4","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00037-014-0089-9","volume":"25","author":"M Blondin","year":"2016","unstructured":"Blondin, M., Krebs, A., McKenzie, P.: The complexity of intersecting finite automata having few final states. Comput. Complex. 25(4), 775\u2013814 (2016). https:\/\/doi.org\/10.1007\/s00037-014-0089-9","journal-title":"Comput. Complex."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90002-W","volume":"97","author":"S Cho","year":"1992","unstructured":"Cho, S., Huynh, D.T.: The parallel complexity of finite-state automata problems. Inf. Comput. 97(1), 1\u201322 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90002-W","journal-title":"Inf. Comput."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"SA Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8, 385\u2013394 (1987). https:\/\/doi.org\/10.1016\/0196-6774(87)90018-6","journal-title":"J. Algorithms"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutation groups. In: FOCS, pp. 36\u201341 (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.34","DOI":"10.1109\/SFCS.1980.34"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00263744","volume":"6","author":"Z Galil","year":"1976","unstructured":"Galil, Z.: Hierarchies of complete problems. Acta Informatica 6, 77\u201388 (1976). https:\/\/doi.org\/10.1007\/BF00263744","journal-title":"Acta Informatica"},{"issue":"2","key":"22_CR8","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_CR9","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."},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of $$k$$-entry deterministic finite automata. J. Automata, Lang. Combinatorics, 6(4), 453\u2013466 (2001) https:\/\/doi.org\/10.25596\/jalc-2001-453","DOI":"10.25596\/jalc-2001-453"},{"key":"22_CR11","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_CR12","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"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68\u201385 (1975). https:\/\/doi.org\/10.1016\/S0022-0000(75)80050-X","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: FOCS 1977, pp. 254\u2013266 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.16","DOI":"10.1109\/SFCS.1977.16"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-55808-X_33","volume-title":"Mathematical Foundations of Computer Science 1992","author":"K-J Lange","year":"1992","unstructured":"Lange, K.-J., Rossmanith, P.: The emptiness problem for intersections of regular languages. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 346\u2013354. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_33"},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.tcs.2004.03.070","volume":"327","author":"A Malcher","year":"2004","unstructured":"Malcher, A.: Minimizing finite automata is computationally hard. Theor. Comput. Sci. 327(3), 375\u2013390 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.03.070","journal-title":"Theor. Comput. Sci."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-18088-5_19","volume-title":"Automata, Languages and Programming","author":"JE Pin","year":"1987","unstructured":"Pin, J.E.: On the languages accepted by finite reversible automata. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 237\u2013249. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18088-5_19"},{"key":"22_CR18","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_CR19","doi-asserted-by":"publisher","unstructured":"Rauch, C., Holzer, M.: On the accepting state complexity of operations on permutation automata. RAIRO Theor. Inform. Appl. 57(9) (2023). https:\/\/doi.org\/10.1051\/ita\/2023010","DOI":"10.1051\/ita\/2023010"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM, 55(4) (2008). https:\/\/doi.org\/10.1145\/1391289.1391291","DOI":"10.1145\/1391289.1391291"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: 5th Annual ACM Symposium on Theory of Computing (STOC 1973, Austin, USA, April 30\u2013May 2, 1973), pp. 1\u20139 (1973). https:\/\/doi.org\/10.1145\/800125.804029","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"22_CR22","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-031-71112-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:04:01Z","timestamp":1725329041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 September 2024","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":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}