{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:57Z","timestamp":1742912817559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031711114"},{"type":"electronic","value":"9783031711121"}],"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_25","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"347-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Measuring Power of\u00a0Commutative Group Languages"],"prefix":"10.1007","author":[{"given":"Takao","family":"Yuyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryoma","family":"Sin\u2019ya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"key":"25_CR1","volume-title":"Codes and Automata, Encyclopedia of Mathematics and its Applications","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press, Cambridge (2010)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Lawson, M.V.: Finite Automata. Chapman and Hall\/CRC (2004)","DOI":"10.1201\/9781482285840"},{"key":"25_CR3","unstructured":"Pin, J.E.: Mathematical foundations of automata theory (2022). https:\/\/www.irif.fr\/~jep\/PDF\/MPRI\/MPRI.pdf"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Group separation strikes back. In: 2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313. IEEE Computer Society, Los Alamitos, CA, USA (2023)","DOI":"10.1109\/LICS56636.2023.10175683"},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory, 1st edn. Cambridge University Press, Cambridge (2008)","edition":"1"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-67731-2_6","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"R Sin\u2019ya","year":"2021","unstructured":"Sin\u2019ya, R.: Asymptotic approximation by regular languages. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 74\u201388. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_6"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-81508-0_29","volume-title":"Developments in Language Theory","author":"R Sin\u2019ya","year":"2021","unstructured":"Sin\u2019ya, R.: Carath\u00e9odory extensions of subclasses of regular languages. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 355\u2013367. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_29"},{"key":"25_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-031-05578-2_22","volume-title":"Developments in Language Theory","author":"R Sin\u2019ya","year":"2022","unstructured":"Sin\u2019ya, R.: Measuring power of locally testable languages. In: Diekert, V., Volkov, M. (eds.) DLT 2022. LNCS, vol. 13257, pp. 274\u2013285. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_22"},{"key":"25_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-031-40247-0_21","volume-title":"CIAA 2023","author":"R Sin\u2019ya","year":"2023","unstructured":"Sin\u2019ya, R.: Measuring power of generalised definite languages. In: Nagy, B. (ed.) CIAA 2023. LNCS, vol. 14151, pp. 278\u2013289. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40247-0_21"},{"issue":"2","key":"25_CR10","first-page":"49","volume":"40","author":"R Sin\u2019ya","year":"2023","unstructured":"Sin\u2019ya, R., Yamaguchi, Y., Nakamura, Y.: Regular languages that can be approximated by testing subword occurrences. Comput. Softw. 40(2), 49\u201360 (2023). (written in Japanese)","journal-title":"Comput. Softw."},{"key":"25_CR11","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, 83\u201390 (1968)","journal-title":"Math. Syst. Theory"},{"key":"25_CR12","unstructured":"Yuyama, T., Sin\u2019ya, R.: Measuring power of commutative group languages (full version) (2024). http:\/\/t-yuyama.jp\/pdfs\/gcommeasure_full.pdf"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:04:18Z","timestamp":1725329058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}