{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:32:04Z","timestamp":1743017524902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"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-62536-8_13","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Two-Dimensional Rank-Reducing Grammars"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1lvaro, F., Cruz, F., S\u00e1nchez, J.A., Ramos Terrades, O., Bened\u00ed, J.M.: Structure detection and segmentation of documents using 2D stochastic context-free grammars. Neurocomputing 150(PA), 147\u2013154 (2015)","DOI":"10.1016\/j.neucom.2014.08.076"},{"issue":"6","key":"13_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2007.09.002","volume":"105","author":"S Crespi Reghizzi","year":"2008","unstructured":"Crespi Reghizzi, S., Pradella, M.: A CKY parser for picture grammars. Inf. Process. Lett. 105(6), 213\u2013217 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94\u2013102 (1970)","journal-title":"Commun. ACM"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jcss.2017.07.011","volume":"95","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L., Thomas, D.G.: Simple picture processing based on finite automata and regular grammars. J. Comput. Syst. Sci. 95, 232\u2013258 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 215\u2013267. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_4"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. In: Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC 1977), STOC 1977, pp. 1\u201310. ACM, New York (1977)","DOI":"10.1145\/800105.803390"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505241.505242","volume":"49","author":"L Lee","year":"2002","unstructured":"Lee, L.: Fast context-free grammar parsing requires fast Boolean matrix multiplication. J. ACM 49(1), 1\u201315 (2002)","journal-title":"J. ACM"},{"key":"13_CR8","unstructured":"Lemaitre, A., Mouch\u00e8re, H., Camillerapp, J., Co\u00fcasnon, B.: Interest of syntactic knowledge for on-line flowchart recognition. In: 9th IAPR International Workshop on Graphics Recognition, 2011, GREC 2011, pp. 85\u201388 (2011)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0023466","volume-title":"STACS 97","author":"O Matz","year":"1997","unstructured":"Matz, O.: Regular expressions and context-free grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 283\u2013294. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023466"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-23679-3_17","volume-title":"Implementation and Application of Automata","author":"F Mr\u00e1z","year":"2019","unstructured":"Mr\u00e1z, F., Pr\u016f\u0161a, D., Wehar, M.: Two-dimensional pattern matching against basic picture languages. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 209\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_17"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-98654-8_23","volume-title":"Developments in Language Theory","author":"M de Oliveira Oliveira","year":"2018","unstructured":"de Oliveira Oliveira, M., Wehar, M.: Intersection non-emptiness and hardness within polynomial time. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 282\u2013290. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_23"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.tcs.2015.05.033","volume":"610","author":"D Pr\u016f\u0161a","year":"2016","unstructured":"Pr\u016f\u0161a, D.: Non-recursive trade-offs between two-dimensional automata and grammars. Theor. Comput. Sci. 610, 121\u2013132 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Pr\u016f\u0161a, D., Fujiyoshi, A.: Rank-reducing two-dimensional grammars for document layout analysis. In: 14th IAPR International Conference on Document Analysis and Recognition (ICDAR 2017), vol. 01, pp. 1120\u20131125 (2017)","DOI":"10.1109\/ICDAR.2017.185"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Pr\u016f\u0161a, D., Hlav\u00e1\u010d, V.: Mathematical formulae recognition using 2D grammars. In: 9th International Conference on Document Analysis and Recognition (ICDAR 2007), pp. 849\u2013853. IEEE Computer Society (2007)","DOI":"10.1109\/ICDAR.2007.4377035"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2016.03.025","volume":"679","author":"D Pr\u016f\u0161a","year":"2017","unstructured":"Pr\u016f\u0161a, D., Reinhardt, K.: Undecidability of the emptiness problem for context-free picture languages. Theor. Comput. Sci. 679, 118\u2013125 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1002\/j.1538-7305.1962.tb00480.x","volume":"41","author":"T Rad\u00f3","year":"1962","unstructured":"Rad\u00f3, T.: On non-computable functions. Bell Syst. Tech. J. 41(3), 877\u2013884 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"13_CR17","volume-title":"Ten Lectures on Statistical and Structural Pattern Recognition (Computational Imaging and Vision)","author":"MI Schlesinger","year":"2012","unstructured":"Schlesinger, M.I., Hlav\u00e1\u010d, V.: Ten Lectures on Statistical and Structural Pattern Recognition (Computational Imaging and Vision), 1st edn. Springer, Dordrecht (2012)","edition":"1"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S0146-664X(72)80019-4","volume":"1","author":"G Siromoney","year":"1972","unstructured":"Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Comput. Graph. Image Process. 1(3), 284\u2013307 (1972)","journal-title":"Comput. Graph. Image Process."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: 44th Annual ACM Symposium on Theory of Computing (STOC 2012), pp. 887\u2013898. ACM, New York (2012)","DOI":"10.1145\/2213977.2214056"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"D Younger","year":"1967","unstructured":"Younger, D.: Recognition of context-free languages in time $$n^3$$. Inf. Control 10, 189\u2013208 (1967)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62536-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T12:05:41Z","timestamp":1741608341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_13","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":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}