{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:19:26Z","timestamp":1742969966122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_16","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"180-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Undecidable Word Problem in Subshift Automorphism Groups"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Guillon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Jeandel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Vanier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-02927-1_13","volume-title":"Automata, Languages and Programming","author":"N Aubrun","year":"2009","unstructured":"Aubrun, N., B\u00e9al, M.-P.: Decidability of conjugacy of tree-shifts of finite type. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 132\u2013143. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_13"},{"key":"16_CR2","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata. Accessed 12 Oct 2007"},{"key":"16_CR3","first-page":"133","volume-title":"Formal Models and Semantics, Handbook of Theoretical Computer Science","author":"W Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Formal Models and Semantics, Handbook of Theoretical Computer Science, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1090\/S0002-9947-1988-0927684-2","volume":"306","author":"M Boyle","year":"1988","unstructured":"Boyle, M., Lind, D.A., Rudolph, D.J.: The automorphism group of a shift of finite type. Trans. Am. Math. Soc. 306(1), 71\u2013114 (1988)","journal-title":"Trans. Am. Math. Soc."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-85238-4_34","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J Kari","year":"2008","unstructured":"Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419\u2013430. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85238-4_34"},{"key":"16_CR6","unstructured":"Coven, E., Yassawi, R.: Endomorphisms and automorphisms of minimal symbolic systems with sublinear complexity (2014)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cyr, V., Kra, B.: The automorphism group of a shift of linear growth: beyond transitivity (2014)","DOI":"10.1017\/fms.2015.3"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Donoso, S., Durand, F., Maass, A., Petite, S.: On automorphism groups of low complexity subshifts (2015)","DOI":"10.1017\/etds.2015.70"},{"key":"16_CR9","unstructured":"Hochman, M.: Groups of automorphisms of SFTs. Open problems (2017). http:\/\/math.huji.ac.il\/~mhochman\/problems\/automorphisms.pdf"},{"key":"16_CR10","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers Jr","year":"1987","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"16_CR11","first-page":"341","volume":"95","author":"MO Rabin","year":"1960","unstructured":"Rabin, M.O.: Computable algebra, general theory and theory of computable fields. Trans. Am. Math. Soc. 95, 341\u2013360 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3, 320\u2013375 (1969)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J Kari","year":"1994","unstructured":"Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. Syst. Sci. 48(1), 149\u2013182 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2016.11.033","volume":"661","author":"N Aubrun","year":"2017","unstructured":"Aubrun, N., Barbieri, S., Sablik, M.: A notion of effectiveness for subshifts on finitely generated groups. Theor. Comput. Sci. 661, 35\u201355 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2016.12.032","volume":"701","author":"T Boykett","year":"2017","unstructured":"Boykett, T., Kari, J., Salo, V.: Finite generating sets for reversible gate sets under general conservation laws. Theor. Comput. Sci. 701, 27\u201339 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"November 2012","key":"16_CR16","first-page":"665","volume":"34","author":"SG Simpson","year":"2014","unstructured":"Simpson, S.G.: Medvedev degrees of 2-dimensional subshifts of finite type. Ergodic Theory Dyn. Syst. 34(November 2012), 665\u2013674 (2014)","journal-title":"Ergodic Theory Dyn. Syst."},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/2272640","volume":"39","author":"W Hanf","year":"1974","unstructured":"Hanf, W., Myers, D.: Non recursive tilings of the plane II. J. Symbolic Logic 39(2), 286\u2013294 (1974)","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:02:33Z","timestamp":1710349353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}