{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:39:20Z","timestamp":1742938760516,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406073"},{"type":"electronic","value":"9783030406080"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40608-0_28","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"397-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reducing the Ambiguity of Parikh Matrices"],"prefix":"10.1007","author":[{"given":"Jeffery","family":"Dick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura K.","family":"Hutchinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Reidenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1142\/S0129054111008817","volume":"22","author":"HMK Alazemi","year":"2011","unstructured":"Alazemi, H.M.K., \u010cern\u00fd, A.: Counting subwords using a trie automaton. Int. J. Found. Comput. Sci. 22(6), 1457\u20131469 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.jcss.2013.01.018","volume":"79","author":"HMK Alazemi","year":"2013","unstructured":"Alazemi, H.M.K., \u010cern\u00fd, A.: Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79(5), 658\u2013668 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR3","unstructured":"Atanasiu, A.: Parikh matrix mapping and amiability over a ternary alphabet. In: Discrete Mathematics and Computer Science, pp. 1\u201312 (2014)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2007.10.022","volume":"390","author":"A Atanasiu","year":"2008","unstructured":"Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theoret. Comput. Sci. 390(1), 102\u2013109 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR5","first-page":"783","volume":"7","author":"A Atanasiu","year":"2001","unstructured":"Atanasiu, A., Mart\u00edn-Vide, C., Mateescu, A.: Codifiable languages and the Parikh matrix mapping. J. UCS 7, 783\u2013793 (2001)","journal-title":"J. UCS"},{"issue":"4","key":"28_CR6","first-page":"289","volume":"49","author":"A Atanasiu","year":"2002","unstructured":"Atanasiu, A., Mart\u00edn-Vide, C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Fund. Inform. 49(4), 289\u2013299 (2002)","journal-title":"Fund. Inform."},{"issue":"06","key":"28_CR7","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1142\/S0129054116500271","volume":"27","author":"A Atanasiu","year":"2016","unstructured":"Atanasiu, A., Teh, W.C.: A new operator over Parikh languages. Int. J. Found. Comput. Sci. 27(06), 757\u2013769 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1142\/S0129054116500118","volume":"27","author":"S Bera","year":"2016","unstructured":"Bera, S., Mahalingam, K.: Some algebraic aspects of Parikh q-matrices. Int. J. Found. Comput. Sci. 27(4), 479\u2013500 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR9","unstructured":"Egecioglu, \u00d6.: A q-matrix encoding extending the Parikh matrix mapping. Technical report 14, Department of Computer Science at UC Santa Barbara (2004)"},{"key":"28_CR10","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/1-4020-8141-3_12","volume-title":"Exploring New Frontiers of Theoretical Informatics","author":"O Egecioglu","year":"2004","unstructured":"Egecioglu, O., Ibarra, O.H.: A matrix q-analogue of the Parikh map. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IIFIP, vol. 155, pp. 125\u2013138. Springer, Boston (2004). https:\/\/doi.org\/10.1007\/1-4020-8141-3_12"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Egecioglu, \u00d6., Ibarra, O.H.: A $$q$$-analogue of the Parikh matrix mapping. In: Formal Models, Languages and Applications [this volume commemorates the 75th birthday of Prof. Rani Siromoney]. In: Series in Machine Perception and Artificial Intelligence, vol. 66, pp. 97\u2013111 (2007)","DOI":"10.1142\/9789812773036_0007"},{"key":"28_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"issue":"01","key":"28_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1142\/S0129054112500049","volume":"23","author":"K Mahalingam","year":"2012","unstructured":"Mahalingam, K., Subramanian, K.G.: Product of Parikh matrices and commutativity. Int. J. Found. Comput. Sci. 23(01), 207\u2013223 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR14","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: On an extension of the Parikh mapping. Turku Centre for Computer Science (2000)"},{"issue":"4","key":"28_CR15","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":"05","key":"28_CR16","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1142\/S0129054119500187","volume":"30","author":"G Poovanandran","year":"2019","unstructured":"Poovanandran, G., Teh, W.C.: Strong (2$$\\cdot $$t) and strong (3$$\\cdot $$t) transformations for strong M-equivalence. Int. J. Found. Comput. Sci. 30(05), 719\u2013733 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1142\/S0129054110007155","volume":"21","author":"A Salomaa","year":"2010","unstructured":"Salomaa, A., Yu, S.: Subword occurrences, Parikh matrices and Lyndon images. Int. J. Found. Comput. Sci. 21, 91\u2013111 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"28_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(03)00396-7","volume":"310","author":"TF \u015eerb\u0103nu\u0163\u0103","year":"2004","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.F.: Extending Parikh matrices. Theor. Comput. Sci. 310(1\u20133), 233\u2013246 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"01","key":"28_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1142\/S0129054109006498","volume":"20","author":"VN \u015eerb\u0103nu\u0163\u0103","year":"2009","unstructured":"\u015eerb\u0103nu\u0163\u0103, V.N.: On Parikh matrices, ambiguity, and prints. Int. J. Found. Comput. Sci. 20(01), 151\u2013165 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR20","unstructured":"\u0160ir\u0161ov, A.I.: Subalgebras of free Lie algebras. Mat. Sbornik N.S. 33(75), 441\u2013452 (1953)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40608-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:34Z","timestamp":1741466554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 February 2020","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2020","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":"lata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lata2020.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 (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":"59","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":"26","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there are 6 invited papers. Due to the coronavirus pandemic the actual conference was postponed to be held together with LATA 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}