{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:11:31Z","timestamp":1771024291365,"version":"3.50.1"},"publisher-location":"Boston","reference-count":8,"publisher":"Kluwer Academic Publishers","isbn-type":[{"value":"1402081405","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_12","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"125-138","source":"Crossref","is-referenced-by-count":6,"title":["A Matrix Q-Analogue of the Parikh Map"],"prefix":"10.1007","author":[{"given":"Omer","family":"Egecioglu","sequence":"first","affiliation":[]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.3233\/FUN-2002-49401","volume":"49","author":"A. Atanasiu","year":"2002","unstructured":"Atanasiu, A., Martin-Vide, C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Fundamenta Informaticae, 49 (2002) 289\u2013299.","journal-title":"Fundamenta Informaticae"},{"key":"12_CR2","unstructured":"Egecioglu, O.: A q-Matrix Encoding Extending the Parikh Matrix Mapping. Proc. Int. Conf. on Computers and Communications (ICCC 2004), Oradea, Romania, May, 2004."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1006\/jcss.2002.1836","volume":"65","author":"T. Harju","year":"2002","unstructured":"Harju, T., Ibarra, O., Karhumaki, J., Salomaa, A: Some decision problems concerning semilinearity and commutation. J. Computer and System Sciences, 65 (2002), 278\u2013294.","journal-title":"J. Computer and System Sciences"},{"key":"12_CR4","first-page":"123","volume":"24","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach., 24 (1978) 123\u2013137.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0304-3975(01)00268-7","volume":"289","author":"O. Ibarra","year":"2002","unstructured":"Ibarra, O., Su, J., Dang, Z., Bultan, T., Kemmerer, R.: Counter machines and verification problems. Theoretical Computer Science, 289 (2002) 165\u2013189.","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","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. Theoretical Informatics and Applications, 35 (2001) 551\u2013564.","journal-title":"Theoretical Informatics and Applications"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach., 13 (1966) 570\u2013581.","journal-title":"J. Assoc. Comput. Mach."},{"key":"12_CR8","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds): Handbook of Formal Languages. Springer, Berlin, 1997."}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:45:18Z","timestamp":1736282718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_12","relation":{},"subject":[]}}