{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:42:44Z","timestamp":1743003764304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030287955"},{"type":"electronic","value":"9783030287962"}],"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-28796-2_5","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"68-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parikh Determinants"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Atanasiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghajendran","family":"Poovanandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen Chean","family":"Teh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1080\/00207160.2012.742243","volume":"90","author":"A Atanasiu","year":"2013","unstructured":"Atanasiu, A., Atanasiu, R.F.: Enriching Parikh matrix mappings. Int. J. Comput. Math. 90(3), 511\u2013521 (2013)","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"5_CR2","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."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Atanasiu, A., Poovanandran, G., Teh, W.C.: Parikh matrices for powers of words. Acta Inform. 1\u201315 (2018)","DOI":"10.1007\/s00236-018-0327-8"},{"issue":"06","key":"5_CR4","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":"04","key":"5_CR5","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(04), 479\u2013499 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1051\/ita\/2009021","volume":"44","author":"A \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, A.: Generalizations of Parikh mappings. RAIRO Theor. Inform. Appl. 44(2), 209\u2013228 (2010)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"3\u20134","key":"5_CR7","first-page":"291","volume":"84","author":"A Clark","year":"2008","unstructured":"Clark, A., Watkins, C.: Some alternatives to Parikh matrices using string kernels. Fund. Inform. 84(3\u20134), 291\u2013303 (2008)","journal-title":"Fund. Inform."},{"key":"5_CR8","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, MA (2004). https:\/\/doi.org\/10.1007\/1-4020-8141-3_12"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0129054118500119","volume":"29","author":"K Mahalingam","year":"2018","unstructured":"Mahalingam, K., Bera, S., Subramanian, K.G.: Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator. Int. J. Found. Comput. Sci. 29(3), 403\u20133413 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-27812-2_16","volume-title":"Theory Is Forever","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A.: Algebraic aspects of Parikh matrices. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 170\u2013180. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27812-2_16"},{"issue":"6","key":"5_CR11","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. Theor. Inform. Appl. 35(6), 551\u2013564 (2001)","journal-title":"Theor. Inform. Appl."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2003.04.001","volume":"68","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1), 1\u201321 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR13","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. Assoc. Comput. Mach. 13, 570\u2013581 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.dam.2018.06.002","volume":"251","author":"G Poovanandran","year":"2018","unstructured":"Poovanandran, G., Teh, W.C.: Elementary matrix equivalence and core transformation graphs for Parikh matrices. Discrete Appl. Math. 251, 276\u2013289 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.tcs.2010.01.036","volume":"411","author":"A Salomaa","year":"2010","unstructured":"Salomaa, A.: Criteria for the matrix equivalence of words. Theoret. Comput. Sci. 411(16), 1818\u20131827 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"5_CR16","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. Theoret. Comput. Sci. 310(1\u20133), 233\u2013246 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR17","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. Internat. J. Found. Comput. Sci. 20(1), 151\u2013165 (2009)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1","key":"5_CR18","first-page":"265","volume":"73","author":"VN \u015eerb\u0103nu\u0163\u0103","year":"2006","unstructured":"\u015eerb\u0103nu\u0163\u0103, V.N., \u015eerb\u0103nu\u0163\u0103, T.F.: Injectivity of the Parikh matrix mappings revisited. Fund. Inform. 73(1), 265\u2013283 (2006)","journal-title":"Fund. Inform."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/s0129054115500069","volume":"26","author":"WC Teh","year":"2015","unstructured":"Teh, W.C.: On core words and the Parikh matrix mapping. Int. J. Found. Comput. Sci. 26(1), 123\u2013142 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3233\/FI-2016-1388","volume":"146","author":"WC Teh","year":"2016","unstructured":"Teh, W.C.: Parikh matrices and Parikh rewriting systems. Fund. Inform. 146, 305\u2013320 (2016)","journal-title":"Fund. Inform."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2016.03.008","volume":"628","author":"WC Teh","year":"2016","unstructured":"Teh, W.C., Atanasiu, A.: On a conjecture about Parikh matrices. Theoret. Comput. Sci. 628, 30\u201339 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2017.11.016","volume":"719","author":"WC Teh","year":"2018","unstructured":"Teh, W.C., Atanasiu, A., Poovanandran, G.: On strongly M-unambiguous prints and \u015eerb\u0103nu\u0163\u0103\u2019s conjecture for Parikh matrices. Theoret. Comput. Sci. 719, 86\u201393 (2018)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28796-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:18:06Z","timestamp":1710249486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28796-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287955","9783030287962"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28796-2_5","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":"9 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/words2019.lboro.ac.uk\/","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":"34","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":"21","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":"62% - 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":"7","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)"}}]}}