{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:18:09Z","timestamp":1783210689578,"version":"3.54.6"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["23-11-00133"],"award-info":[{"award-number":["23-11-00133"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ic.2026.105488","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:01:48Z","timestamp":1781827308000},"page":"105488","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Decision problems for reversible and permutation automata"],"prefix":"10.1016","volume":"312","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":"78","reference":[{"issue":"1","key":"10.1016\/j.ic.2026.105488_bib0001","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01691347","article-title":"Permutation automata","volume":"2","author":"Thierrin","year":"1968","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"10.1016\/j.ic.2026.105488_bib0002","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","article-title":"Inference of reversible languages","volume":"29","author":"Angluin","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2026.105488_bib0003","series-title":"Automata, Languages and Programming, 14th International Colloquium","first-page":"237","article-title":"On the language accepted by finite reversible automata","volume":"267","author":"Pin","year":"1987"},{"key":"10.1016\/j.ic.2026.105488_bib0004","series-title":"Sweeping permutation automata","volume":"63","author":"Radionova","year":"2026"},{"key":"10.1016\/j.ic.2026.105488_bib0005","series-title":"CONCUR 2021","first-page":"18:1","article-title":"Decomposing permutation automata","volume":"203","author":"Jecker","year":"2021"},{"key":"10.1016\/j.ic.2026.105488_bib0006","series-title":"DLT 2020, LNCS 12086","first-page":"122","article-title":"Operations on permutation automata","author":"Hospod\u00e1r","year":"2020"},{"issue":"9","key":"10.1016\/j.ic.2026.105488_bib0007","article-title":"On the accepting state complexity of operations on permutation automata","volume":"57","author":"Rauch","year":"2023","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3-4","key":"10.1016\/j.ic.2026.105488_bib0008","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1142\/S0129054122410052","article-title":"Weakly and strongly irreversible regular languages","volume":"33","author":"Guillon","year":"2022","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105488_bib0009","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.tcs.2016.11.006","article-title":"One-way reversible multi-head finite automata","volume":"682","author":"Kutrib","year":"2017","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ic.2026.105488_bib0010","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ic.2026.105488_bib0011","series-title":"Proceedings of the 5th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"issue":"4","key":"10.1016\/j.ic.2026.105488_bib0012","first-page":"453","article-title":"On the state complexity of k-entry deterministic finite automata","volume":"6","author":"Holzer","year":"2001","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"10.1016\/j.ic.2026.105488_bib0013","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","article-title":"A note on the space complexity of some decision problems for finite automata","volume":"40","author":"Jiang","year":"1991","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2026.105488_bib0014","series-title":"FOCS 1977","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"issue":"1-2","key":"10.1016\/j.ic.2026.105488_bib0015","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0304-3975(98)00225-4","article-title":"PSPACE-complete problems for subgroups of free groups and inverse finite automata","volume":"242","author":"Birget","year":"2000","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ic.2026.105488_bib0016","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00037-014-0089-9","article-title":"The complexity of intersecting finite automata having few final states","volume":"25","author":"Blondin","year":"2016","journal-title":"Comput. Complex."},{"key":"10.1016\/j.ic.2026.105488_bib0017","series-title":"International Symposium on Mathematical Foundations of Computer Science (MFCS 1992)","first-page":"346","article-title":"The emptiness problem for intersections of regular languages","volume":"629","author":"Lange","year":"1992"},{"key":"10.1016\/j.ic.2026.105488_bib0018","series-title":"FOCS","first-page":"36","article-title":"Polynomial-time algorithms for permutation groups","author":"Furst","year":"1980"},{"key":"10.1016\/j.ic.2026.105488_bib0019","series-title":"STOC","first-page":"10","article-title":"On the time and tape complexity of languages","author":"Hunt","year":"1973"},{"key":"10.1016\/j.ic.2026.105488_bib0020","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00263744","article-title":"Hierarchies of complete problems","volume":"6","author":"Galil","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/j.ic.2026.105488_bib0021","series-title":"Theory of Computation","author":"Kozen","year":"2006"},{"issue":"2","key":"10.1016\/j.ic.2026.105488_bib0022","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","article-title":"Lower bounds on the size of sweeping automata","volume":"21","author":"Sipser","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.ic.2026.105488_bib0023","doi-asserted-by":"crossref","DOI":"10.1145\/1391289.1391291","article-title":"Undirected connectivity in log-space","volume":"55","author":"Reingold","year":"2008","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/j.ic.2026.105488_bib0024","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inf. Control"},{"key":"10.1016\/j.ic.2026.105488_bib0025","series-title":"STOC \u201987: Proceedings of the 19th Annual ACM Symposium on Theory of Computing","first-page":"409","article-title":"Permutation groups in NC","author":"Babai","year":"1987"},{"key":"10.1016\/j.ic.2026.105488_bib0026","series-title":"Mathematical Foundations of Computer Science (MFCS","first-page":"544","article-title":"Removing bidirectionality from nondeterministic finite automata","volume":"3618","author":"Kapoutsis","year":"2005"},{"key":"10.1016\/j.ic.2026.105488_bib0027","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The reduction of two-way automata to one-way automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Res. Dev."},{"issue":"8","key":"10.1016\/j.ic.2026.105488_bib0028","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/j.ic.2007.01.008","article-title":"Complementing two-way finite automata","volume":"205","author":"Geffert","year":"2007","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2026.105488_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2020.104631","article-title":"Reversibility of computations in graph-walking automata","volume":"275","author":"Kunc","year":"2020","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.ic.2026.105488_bib0030","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.tcs.2004.03.070","article-title":"Minimizing finite automata is computationally hard","volume":"327","author":"Malcher","year":"2004","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105488_bib0031","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1142\/S0129054118400063","article-title":"Minimal reversible deterministic finite automata","volume":"29","author":"Holzer","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105488_bib0032","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1142\/S0129054116400050","article-title":"Minimal and hyper-minimal biautomata","volume":"27","author":"Holzer","year":"2016","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ic.2026.105488_bib0033","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90002-W","article-title":"The parallel complexity of finite-state automata problems","volume":"97","author":"Cho","year":"1992","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2026.105488_bib0034","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/j.ic.2026.105488_bib0035","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","article-title":"Descriptional and computational complexity of finite automata\u2014a survey","volume":"209","author":"Holzer","year":"2011","journal-title":"Inf. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T23:51:18Z","timestamp":1783209078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":35,"alternative-id":["S0890540126000854"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105488","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decision problems for reversible and permutation automata","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105488","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105488"}}