{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:11:03Z","timestamp":1742911863244,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402463"},{"type":"electronic","value":"9783031402470"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40247-0_12","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:02:54Z","timestamp":1691568174000},"page":"166-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When Is Context-Freeness Distinguishable from\u00a0Regularity? an\u00a0Extension of\u00a0Parikh\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"Hashimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"12_CR1","unstructured":"Atanasiu, A., Mart\u00edn-Vide, C., Mateescu, A.I.: On the injectivity of the Parikh matrix mapping, Fundamenta Informaticae 49(4), 289\u2013299 (2002)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bhattiprolu, V., Gordon, S., Viswanathan, M.: Extending Parikh\u2019s theorem to weighted and probabilistic context-free grammars. In: 14th International Conference on Quantitative Evaluation of Systems, pp. 5\u20137 (2017)","DOI":"10.1007\/978-3-319-66335-7_1"},{"issue":"12","key":"12_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh\u2019s theorem: a simple and direct automaton construction. Inf. Process. Lett. 111(12), 614\u2013619 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90103-0","volume":"19","author":"J Goldstine","year":"1977","unstructured":"Goldstine, J.: A simplified proof of Parikh\u2019s theorem. Discret. Math. 19(3), 235\u2013239 (1977)","journal-title":"Discret. Math."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0012-365X(72)90013-1","volume":"2","author":"SA Greibach","year":"1972","unstructured":"Greibach, S.A.: A generalization of Parikh\u2019s semilinear theorem. Discret. Math. 2(4), 347\u2013355 (1972)","journal-title":"Discret. Math."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Hutchinson, L.K., Merca\u015f, R., Reidenbach, D.: A toolkit for Parikh matrices. In: 26th International Conference on Implementation and Application of Automata, pp. 116\u2013127 (2022)","DOI":"10.1007\/978-3-031-07469-1_9"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Lawson, M.V.: Finite Automata. Chapman and Hall\/CRC, New York (2003)","DOI":"10.1201\/9781482285840"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1051\/ita:2001131","volume":"35","author":"A Mateescu","year":"2001","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping. Theoret. Inf. Appl. 35, 551\u2013564 (2001)","journal-title":"Theoret. Inf. Appl."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1112\/jlms\/s2-6.4.663","volume":"2","author":"DL Pilling","year":"1973","unstructured":"Pilling, D.L.: Commutative regular equations and Parikh\u2019s theorem. J. London Math. Soc. 2(6), 663\u2013666 (1973)","journal-title":"J. London Math. Soc."},{"key":"12_CR11","volume-title":"Mathematical foundations of automata theory","author":"J\u00c9 Pin","year":"2010","unstructured":"Pin, J.\u00c9.: Mathematical foundations of automata theory. Universit\u00e9 Paris, Lecture notes LIAFA (2010)"}],"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-40247-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:09:12Z","timestamp":1691568552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40247-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402463","9783031402470"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40247-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","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":"Famagusta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa.emu.edu.tr\/en","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"20","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":"67% - 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-3","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)"}}]}}