{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:04:46Z","timestamp":1648613086268},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1007\/bf00288776","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T15:51:37Z","timestamp":1096905097000},"page":"421-432","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of the word problem for commutative semigroups of fixed dimension"],"prefix":"10.1007","volume":"22","author":[{"given":"Dung T.","family":"Huynh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report, Proc. 8th Ann. ACM Symposium on Theory of Computing, pp. 50?54, 1976","DOI":"10.1145\/800113.803630"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/BF02196421","volume":"8","author":"A.P. Biryukov","year":"1967","unstructured":"Biryukov, A.P.: Some Algorithmic Problems for Finitely Defined Commutative Semigroups. Sib. Math. J. 8, 384?391 (1967)","journal-title":"Sib. Math. J."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational Sets in Commutative Monoids. J. Algebra 13, 173?191 (1969)","journal-title":"J. Algebra"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","volume":"2","author":"P.C. Fisher","year":"1968","unstructured":"Fisher, P.C., Meyer, A.R., Rosenberg, A.L.: Counter Machines and Counter Languages. Math. Syst. Theory 2, 265?283 (1968)","journal-title":"Math. Syst. Theory"},{"key":"CR5","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley 1979"},{"key":"CR6","unstructured":"Huynh, D.T.: The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. Manuscript, 1984 (To appear in SIAM J. Comput.)"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Huynh, D.T.: The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems. Proc. 17th STOC, pp. 405?412, 1985","DOI":"10.1145\/22145.22190"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Van Leeuwen, J.: A Partial Solution to the Reachability Problem for Vector Addition Systems. Proc. 6th Ann. ACM Symposium on Theory of Computing, pp. 303?307, 1974","DOI":"10.1145\/800119.803908"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","volume":"19","author":"H.R. Lewis","year":"1982","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Symmetric Space-Bounded Computation. Theor. Comput. Sci. 19, 161?187 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"45","author":"E. Mayr","year":"1982","unstructured":"Mayr, E., Meyer, A.R.: The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals. Adv. Math. 45, 305?329 (1982)","journal-title":"Adv. Math."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. Proc. 13th Ann. Symposium on Theory of Computing, pp. 238?246, 1981","DOI":"10.1145\/800076.802477"},{"key":"CR12","first-page":"201","volume":"9","author":"M.A. Taiclin","year":"1968","unstructured":"Taiclin, M.A.: Algorithmic Problem for Commutative Semigroups. Sov. Math. Dokl. 9, 201?204 (1968)","journal-title":"Sov. Math. Dokl."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:27Z","timestamp":1554758067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["BF00288776"],"URL":"https:\/\/doi.org\/10.1007\/bf00288776","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}