{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T14:42:30Z","timestamp":1779374550446,"version":"3.53.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030134341","type":"print"},{"value":"9783030134358","type":"electronic"}],"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-13435-8_6","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"82-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Bounded Automata Groups are co-ET0L"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6803-1143","authenticated-orcid":false,"given":"Alex","family":"Bishop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2438-3945","authenticated-orcid":false,"given":"Murray","family":"Elder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"4","key":"6_CR1","first-page":"18","volume":"7","author":"AV An\u012bs\u012bmov","year":"1971","unstructured":"An\u012bs\u012bmov, A.V.: The group languages. Kibernetika (Kiev) 7(4), 18\u201324 (1971)","journal-title":"Kibernetika (Kiev)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/S0019-9958(77)90308-4","volume":"34","author":"PRJ Asveld","year":"1977","unstructured":"Asveld, P.R.J.: Controlled iteration grammars and full hyper-AFL\u2019s. Inf. Control 34(3), 248\u2013269 (1977)","journal-title":"Inf. Control"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1112\/jlms\/jdw04","volume":"94","author":"C Bleak","year":"2016","unstructured":"Bleak, C., Matucci, F., Neunh\u00f6ffer, M.: Embeddings into Thompson\u2019s group \n                      \n                        \n                      \n                      $$V$$\n                     and \n                      \n                        \n                      \n                      $$co\\cal{CF}$$\n                     groups. J. Lond. Math. Soc. (2) 94(2), 583\u2013597 (2016). \n                      https:\/\/doi.org\/10.1112\/jlms\/jdw04","journal-title":"J. Lond. Math. Soc. (2)"},{"issue":"5","key":"6_CR4","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1142\/S0218196716500363","volume":"26","author":"L Ciobanu","year":"2016","unstructured":"Ciobanu, L., Diekert, V., Elder, M.: Solution sets for equations over free groups are EDT0L languages. Int. J. Algebra Comput. 26(5), 843\u2013886 (2016). \n                      https:\/\/doi.org\/10.1142\/S0218196716500363","journal-title":"Int. J. Algebra Comput."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218196718500145","volume":"28","author":"L Ciobanu","year":"2018","unstructured":"Ciobanu, L., Elder, M., Ferov, M.: Applications of L systems to group theory. Int. J. Algebra Comput. 28(2), 309\u2013329 (2018). \n                      https:\/\/doi.org\/10.1142\/S0218196718500145","journal-title":"Int. J. Algebra Comput."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/00207167408803079","volume":"4","author":"K Culik II","year":"1974","unstructured":"Culik II, K.: On some families of languages related to developmental systems. Int. J. Comput. Math. 4, 31\u201342 (1974). \n                      https:\/\/doi.org\/10.1080\/00207167408803079","journal-title":"Int. J. Comput. Math."},{"key":"6_CR7","unstructured":"Diekert, V., Elder, M.: Solutions of twisted word equations, EDT0L languages, and context-free groups. In: 44th International Colloquium on Automata, Languages, and Programming, LIPIcs. Leibniz International Proceedings in Informatics, vol. 80, Article No. 96, 14. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2017)"},{"key":"6_CR8","unstructured":"Diekert, V., Je\u017c, A., Kufleitner, M.: Solutions of word equations over partially commutative structures. In: 43rd International Colloquium on Automata, Languages, and Programming, LIPIcs. Leibniz International Proceedings in Informatics, vol. 55, Article No. 127, 14. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2016)"},{"issue":"8","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1142\/S0218196708004901","volume":"18","author":"M Elder","year":"2008","unstructured":"Elder, M., Kambites, M., Ostheimer, G.: On groups and counter automata. Int. J. Algebra Comput. 18(8), 1345\u20131364 (2008). \n                      https:\/\/doi.org\/10.1142\/S0218196708004901","journal-title":"Int. J. Algebra Comput."},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"DBA Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1090\/dimacs\/025\/03","volume-title":"Geometric and Computational Perspectives on Infinite Groups","author":"Robert Gilman","year":"1995","unstructured":"Gilman, R.H.: Formal languages and infinite groups. In: Geometric and Computational Perspectives on Infinite Groups, Minneapolis, MN and New Brunswick, NJ, 1994. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 25, pp. 27\u201351. American Mathematical Society, Providence (1996)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01078416","volume":"14","author":"R Grigorchuk","year":"1980","unstructured":"Grigorchuk, R.: On Burnside\u2019s problem on periodic groups. Funktsional. Anal. i Prilozhen. 14(1), 53\u201354 (1980)","journal-title":"Funktsional. Anal. i Prilozhen."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01179757","volume":"182","author":"N Gupta","year":"1983","unstructured":"Gupta, N., Sidki, S.: On the Burnside problem for periodic groups. Mathematische Zeitschrift 182(3), 385\u2013388 (1983). \n                      https:\/\/doi.org\/10.1007\/BF01179757","journal-title":"Mathematische Zeitschrift"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1112\/S002461070500654X","volume":"71","author":"DF Holt","year":"2005","unstructured":"Holt, D.F., Rees, S., R\u00f6ver, C.E., Thomas, R.M.: Groups with context-free co-word problem. J. Lond. Math. Soc. (2) 71(3), 643\u2013657 (2005). \n                      https:\/\/doi.org\/10.1112\/S002461070500654X","journal-title":"J. Lond. Math. Soc. (2)"},{"issue":"5","key":"6_CR15","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1142\/S0218196706003359","volume":"16","author":"DF Holt","year":"2006","unstructured":"Holt, D.F., R\u00f6ver, C.E.: Groups with indexed co-word problem. Int. J. Algebra Comput. 16(5), 985\u20131014 (2006). \n                      https:\/\/doi.org\/10.1142\/S0218196706003359","journal-title":"Int. J. Algebra Comput."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, D., Lohrey, M., Zetzsche, G.: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. In: Algebra and Computer Science, Contemporary Mathematics, vol. 677, pp. 129\u2013144. American Mathematical Society, Providence (2016)","DOI":"10.1090\/conm\/677\/13625"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"van Leeuwen, J.: Variations of a new machine model. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas 1976, pp. 228\u2013235. IEEE Computer Society, Long Beach, October 1976. \n                      https:\/\/doi.org\/10.1109\/SFCS.1976.35","DOI":"10.1109\/SFCS.1976.35"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1112\/blms\/bdl043","volume":"39","author":"J Lehnert","year":"2007","unstructured":"Lehnert, J., Schweitzer, P.: The co-word problem for the Higman-Thompson group is context-free. Bull. Lond. Math. Soc. 39(2), 235\u2013241 (2007). \n                      https:\/\/doi.org\/10.1112\/blms\/bdl043","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","volume":"18","author":"A Lindenmayer","year":"1968","unstructured":"Lindenmayer, A.: Mathematical models for cellular interactions in development I. Filaments with one-sided inputs. J. Theoret. Biol. 18(3), 280\u201399 (1968). \n                      https:\/\/doi.org\/10.1016\/0022-5193(68)90079-9","journal-title":"J. Theoret. Biol."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"DE Muller","year":"1985","unstructured":"Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theoret. Comput. Sci. 37(1), 51\u201375 (1985). \n                      https:\/\/doi.org\/10.1016\/0304-3975(85)90087-8","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/117","volume-title":"Self-similar Groups, Mathematical Surveys and Monographs","author":"V Nekrashevych","year":"2005","unstructured":"Nekrashevych, V.: Self-similar Groups, Mathematical Surveys and Monographs, vol. 117. American Mathematical Society, Providence (2005). \n                      https:\/\/doi.org\/10.1090\/surv\/117"},{"key":"6_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997). \n                      https:\/\/doi.org\/10.1007\/978-3-642-59126-6"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00985664","volume":"2","author":"G Rozenberg","year":"1973","unstructured":"Rozenberg, G.: Extension of tabled OL-systems and languages. Int. J. Comput. Inf. Sci. 2, 311\u2013336 (1973)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1925","DOI":"10.1007\/BF02677504","volume":"100","author":"S Sidki","year":"2000","unstructured":"Sidki, S.: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci. (New York) 100(1), 1925\u20131943 (2000). \n                      https:\/\/doi.org\/10.1007\/BF02677504\n                      \n                    . Algebra, 12","journal-title":"J. Math. Sci. (New York)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:48:31Z","timestamp":1558478911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","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":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - 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"}},{"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"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}