{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:48Z","timestamp":1725562908064},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_57","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"653-664","source":"Crossref","is-referenced-by-count":1,"title":["Semi-linear Parikh Images of Regular Expressions via Reduction"],"prefix":"10.1007","author":[{"given":"Bahareh","family":"Badban","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Torabi Dashti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"57_CR1","first-page":"129","volume":"36","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: A fully equational proof of Parikh\u2019s theorem. ITA\u00a036(2), 129\u2013153 (2002)","journal-title":"ITA"},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-10843-2_26","volume-title":"Automata, Languages and Programming","author":"M. Blattner","year":"1981","unstructured":"Blattner, M., Latteux, M.: Parikh-bounded languages. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 316\u2013323. Springer, Heidelberg (1981)"},{"issue":"5","key":"57_CR3","first-page":"419","volume":"35","author":"M. Delgado","year":"2001","unstructured":"Delgado, M.: Commutative images of rational languages and the Abelian kernel of a monoid. ITA\u00a035(5), 419\u2013435 (2001)","journal-title":"ITA"},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90103-0","volume":"19","author":"J. Goldstine","year":"1977","unstructured":"Goldstine, J.: A simplified proof of Parikh\u2019s theorem. Discrete Math.\u00a019, 235\u2013239 (1977)","journal-title":"Discrete Math."},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/800113.803641","volume-title":"STOC 1976","author":"O. Ibarra","year":"1976","unstructured":"Ibarra, O., Kim, C.: A useful device for showing the solvability of some decision problems. In: STOC 1976, pp. 135\u2013140. ACM, New York (1976)"},{"issue":"4","key":"57_CR6","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1112\/jlms\/s2-6.4.663","volume":"6","author":"D. Pilling","year":"1973","unstructured":"Pilling, D.: Commutative regular equations and Parikh\u2019s theorem. J. London Math. Soc.\u00a06, 633\u2013666 (1973)","journal-title":"J. London Math. Soc."},{"key":"57_CR8","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"57_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/11532231_25","volume-title":"Automated Deduction \u2013 CADE-20","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational Horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 337\u2013352. Springer, Heidelberg (2005)"},{"key":"57_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2004.07.015","volume":"328","author":"G. Xie","year":"2004","unstructured":"Xie, G., Li, C., Deng, Z.: Linear reachability problems and minimal solutions to linear Diophantine equation systems. TCS\u00a0328, 203\u2013219 (2004)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:50Z","timestamp":1606186910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}