{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:55:08Z","timestamp":1776858908520,"version":"3.51.2"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319644189","type":"print"},{"value":"9783319644196","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_13","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"98-105","source":"Crossref","is-referenced-by-count":2,"title":["Dissecting Power of Certain Matrix Languages"],"prefix":"10.1007","author":[{"given":"J.","family":"Julie","sequence":"first","affiliation":[]},{"given":"J.","family":"Baskar Babujee","sequence":"additional","affiliation":[]},{"given":"V.","family":"Masilamani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"13_CR1","volume-title":"Introduction to Automata Theory. Languages and Computation","author":"J Hopcroft","year":"2006","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory. Languages and Computation, 3rd edn. Addison-Wesley, Boston (2006)","edition":"3"},{"issue":"1\u20134","key":"13_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/00207167408803090","volume":"4","author":"K Krithivasan","year":"1974","unstructured":"Krithivasan, K., Siromoney, R.: Characterizations of regular and context free matrices. Int. J. Comput. Math. 4(1\u20134), 229\u2013445 (1974)","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"13_CR3","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1961","unstructured":"Parikh, R.: On context free languages. J. ACM. B. 13(4), 570\u2013581 (1961)","journal-title":"J. ACM. B."},{"issue":"1","key":"13_CR4","first-page":"59","volume":"3","author":"V Radhakrishnan","year":"1998","unstructured":"Radhakrishnan, V., Chakravarthy, V., Krithivasan, K.: Pattern matching in matrix grammars. J. Autom. Lang. Comb. 3(1), 59\u201376 (1998)","journal-title":"J. Autom. Lang. Comb."},{"key":"13_CR5","volume-title":"Formal Languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"13_CR6","doi-asserted-by":"crossref","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 family of matrices and picture language. Comput. Graph. Image Process. 1, 284\u2013307 (1972)","journal-title":"Comput. Graph. Image Process."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(73)90573-1","volume":"22","author":"G Siromoney","year":"1973","unstructured":"Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Inf. Control 22, 447\u2013470 (1973)","journal-title":"Inf. Control"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1016\/j.ic.2008.03.024","volume":"206","author":"R Steibe","year":"2008","unstructured":"Steibe, R.: Slender siromoney matrix languages. Inf. Comput. 206, 1248\u20131258 (2008)","journal-title":"Inf. Comput."},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.ipl.2012.12.006","volume":"113","author":"T Yamakami","year":"2013","unstructured":"Yamakami, T., Kato, Y.: The dissecting power of regular languages. Inf. Process. Lett. 113, 116\u2013122 (2013)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T22:45:31Z","timestamp":1508885131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}