{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:17:55Z","timestamp":1726039075474},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662596197"},{"type":"electronic","value":"9783662596203"}],"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-662-59620-3_5","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T23:04:57Z","timestamp":1564700697000},"page":"79-92","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards a 2-Multiple Context-Free Grammar for the 3-Dimensional Dyck Language"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Kogkalidis","sequence":"first","affiliation":[]},{"given":"Orestis","family":"Melkonian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,6]]},"reference":[{"issue":"POPL","key":"5_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/3158118","volume":"2","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Choudhary, B., Pavlogiannis, A.: Optimal Dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang. 2(POPL), 30 (2017)","journal-title":"Proc. ACM Program. Lang."},{"key":"5_CR2","series-title":"Synthese Language Library (Texts and Studies in Linguistics and Philosophy)","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-94-009-7707-5_5","volume-title":"The Nature of Syntactic Representation","author":"G Gazdar","year":"1982","unstructured":"Gazdar, G.: Phrase structure grammar. In: Jacobson, P., Pullum, G.K. (eds.) The Nature of Syntactic Representation. Synthese Language Library (Texts and Studies in Linguistics and Philosophy), vol. 15, pp. 131\u2013186. Springer, Dordrecht (1982). https:\/\/doi.org\/10.1007\/978-94-009-7707-5_5"},{"key":"5_CR3","volume-title":"Generalized Phrase Structure Grammar","author":"G Gazdar","year":"1985","unstructured":"Gazdar, G., Klein, E., Pullum, G.K., Sag, I.A.: Generalized Phrase Structure Grammar. Harvard University Press, Cambridge (1985)"},{"key":"5_CR4","unstructured":"Kanazawa, M., Salvati, S.: MIX is not a tree-adjoining language. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers-Volume 1. pp. 666\u2013674. Association for Computational Linguistics (2012)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02101184","volume":"180","author":"G Kuperberg","year":"1996","unstructured":"Kuperberg, G.: Spiders for rank 2 Lie algebras. Commun. Math. Phys. 180(1), 109\u2013151 (1996)","journal-title":"Commun. Math. Phys."},{"key":"5_CR6","volume-title":"Elements of the Theory of Computation","author":"HR Lewis","year":"1997","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice Hall PTR, New Jersey (1997)"},{"key":"5_CR7","unstructured":"Ljungl\u00f6f, P.: Practical parsing of parallel multiple context-free grammars. In: Workshop on Tree Adjoining Grammars and Related Formalisms, p. 144 (2012)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-54789-8_16","volume-title":"Categories and Types in Logic, Language, and Physics","author":"M Moortgat","year":"2014","unstructured":"Moortgat, M.: A note on multidimensional Dyck languages. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds.) Categories and Types in Logic, Language, and Physics. LNCS, vol. 8222, pp. 279\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54789-8_16"},{"key":"5_CR9","unstructured":"Nederhof, M.J., Shieber, S., Satta, G.: Partially ordered multiset context-free grammars and ID\/LP parsing. Association for Computational Linguistics (2003)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10801-008-0150-3","volume":"30","author":"TK Petersen","year":"2009","unstructured":"Petersen, T.K., Pylyavskyy, P., Rhoades, B.: Promotion and cyclic sieving via webs. J. Algebr. Comb. 30(1), 19\u201341 (2009)","journal-title":"J. Algebr. Comb."},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1515\/9783110873467.209","volume":"6","author":"M Reape","year":"1996","unstructured":"Reape, M.: Getting things in order. Discontinuous Const. 6, 209\u2013253 (1996)","journal-title":"Discontinuous Const."},{"issue":"11\u201312","key":"5_CR12","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T Reps","year":"1998","unstructured":"Reps, T.: Program analysis via graph reachability. Inf. Softw. Technol. 40(11\u201312), 701\u2013726 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 49\u201361. ACM (1995)","DOI":"10.1145\/199448.199462"},{"issue":"7","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1016\/j.jcss.2015.03.004","volume":"81","author":"S Salvati","year":"2015","unstructured":"Salvati, S.: MIX is a 2-MCFL and the word problem in $$Z^2$$ is solved by a third-order collapsible pushdown automaton. J. Comput. Syst. Sci. 81(7), 1252\u20131277 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-662-21545-6_1","volume-title":"Automata, Languages and Programming","author":"A Wijngaarden","year":"1974","unstructured":"Wijngaarden, A.: The generative power of two-level grammars. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 9\u201316. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/978-3-662-21545-6_1"}],"container-title":["Lecture Notes in Computer Science","At the Intersection of Language, Logic, and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59620-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T19:37:07Z","timestamp":1695065827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59620-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662596197","9783662596203"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59620-3_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":"6 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESSLLI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Summer School in Logic, Language and Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sofia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esslli2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/esslli2018.folli.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"24","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":"14","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":"58% - 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":"4","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","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)"}}]}}