{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:01:44Z","timestamp":1742947304110,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030815073"},{"type":"electronic","value":"9783030815080"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81508-0_30","type":"book-chapter","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:31:31Z","timestamp":1628206291000},"page":"368-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parikh Word Representable Graphs and Morphisms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4057-3220","authenticated-orcid":false,"given":"Nobin","family":"Thomas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3722-3326","authenticated-orcid":false,"given":"Lisa","family":"Mathew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1886-5681","authenticated-orcid":false,"given":"Somnath","family":"Bera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5549-6435","authenticated-orcid":false,"given":"Atulya K.","family":"Nagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8726-5850","authenticated-orcid":false,"given":"K. G.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,6]]},"reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1142\/S0129054110007702","volume":"21","author":"A Atanasiu","year":"2010","unstructured":"Atanasiu, A.: Parikh matrices, amiability and Istrail morphism. Int. J. Found. Comput. Sci. 21(6), 1021\u20131033 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"02","key":"30_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054107004735","volume":"18","author":"A Atanasiu","year":"2007","unstructured":"Atanasiu, A.: Binary amiable words. Int. J. Found. Comput. Sci. 18(02), 387\u2013400 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"30_CR3","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. Theor. Comput. Sci. 390(1), 102\u2013109 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s11786-016-0257-1","volume":"10","author":"S Bera","year":"2016","unstructured":"Bera, S., Mahalingam, K.: Structural properties of word representable graphs. Math. Comput. Sci. 10(2), 209\u2013222 (2016)","journal-title":"Math. Comput. Sci."},{"key":"30_CR5","volume-title":"Graph Theory with Applications","author":"GA Bondy","year":"1982","unstructured":"Bondy, G.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1982)"},{"key":"30_CR6","first-page":"301","volume":"21","author":"S Istrail","year":"1977","unstructured":"Istrail, S.: On irreducible languages and nonrational numbers. Bulletin math\u00e9matique de la Soci\u00e9t\u00e9 des sciences math\u00e9matiques de Roumanie 21, 301\u2013308 (1977)","journal-title":"Bulletin math\u00e9matique de la Soci\u00e9t\u00e9 des sciences math\u00e9matiques de Roumanie"},{"doi-asserted-by":"publisher","unstructured":"Kitaev, S., Lozin, V.: Words and Graphs, vol.\u00a017. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25859-1","key":"30_CR7","DOI":"10.1007\/978-3-319-25859-1"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4236\/ojdm.2011.12012","volume":"1","author":"S Kitaev","year":"2011","unstructured":"Kitaev, S., Salimov, P., Severs, C., Ulfarsson, H.: Word-representability of line graphs. Open J. Discrete Math. 1(2), 96\u2013101 (2011)","journal-title":"Open J. Discrete Math."},{"issue":"02","key":"30_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054104002418","volume":"15","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A.: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci. 15(02), 277\u2013292 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"30_CR10","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. RAIRO - Theor. Inf. Appl. 35(6), 551\u2013564 (2001)","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.aam.2019.02.009","volume":"107","author":"L Mathew","year":"2019","unstructured":"Mathew, L., Thomas, N., Somnath, B., Subramanian, K.G.: Some results on Parikh word representable graphs and partitions. Adv. Appl. Math. 107, 102\u2013115 (2019)","journal-title":"Adv. Appl. Math."},{"unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison Wesley, Boston (1983)","key":"30_CR12"},{"issue":"4","key":"30_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. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"30_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-98355-4_7","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"A Salomaa","year":"2018","unstructured":"Salomaa, A.: Parikh matrices: subword indicators and degrees of ambiguity. In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 100\u2013112. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98355-4_7"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.dam.2019.12.005","volume":"282","author":"WC Teh","year":"2020","unstructured":"Teh, W.C., Ng, Z.C., Javaid, M., Chern, Z.J.: Parikh word representability of bipartite permutation graphs. Discrete Appl. Math. 282, 208\u2013221 (2020)","journal-title":"Discrete Appl. Math."},{"issue":"01","key":"30_CR17","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(01), 123\u2013142 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2015.03.037","volume":"582","author":"WC Teh","year":"2015","unstructured":"Teh, W.C., Kwa, K.H.: Core words and Parikh matrices. Theor. Comput. Sci. 582, 60\u201369 (2015)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81508-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T23:35:31Z","timestamp":1628206531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81508-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030815073","9783030815080"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81508-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt2021.dcc.fc.up.pt\/","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":"48","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":"27","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":"56% - 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":"6","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)"}}]}}