{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:44:53Z","timestamp":1758278693312},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_22","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"267-278","source":"Crossref","is-referenced-by-count":6,"title":["On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik, and A. Ing\u00f3lfsd\u00f3ttir, On the two-variable fragment of the equational theory of the max-sum algebra of the natural numbers, BRICS Report RS-99-22, August 1999.","DOI":"10.7146\/brics.v6i22.20079"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"L. Aceto, Z. \u00c9sik, and A. Ing\u00f3lfsd\u00f3ttir, The max-plus algebra of the natural numbers has no finite equational basis, BRICS Report RS-99-33, October 1999. To appear in Theoretical Computer Science.","DOI":"10.7146\/brics.v6i33.20102"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"22_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S. Burris","year":"1981","unstructured":"S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, New York, 1981."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"J. Gunawardena (ed.), Idempotency, Publications of the Newton Institute 11, Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511662508"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. Comput. System Sci., 24 (1982), no. 2, pp. 233\u2013244.","journal-title":"J. Comput. System Sci."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0013113","volume-title":"Formal Properties of Finite Automata and Applications","author":"K. Hashiguchi","year":"1989","unstructured":"K. Hashiguchi, Relative star-height, star-height and finite automata with distance functions, in Formal Properties of Finite Automata and Applications (J.E. Pin ed.), Lecture Notes in Computer Science 386, Springer-Verlag, 1989, pp. 74\u201388."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science 5, Springer-Verlag, 1986.","DOI":"10.1007\/978-3-642-69959-7_2"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0747-7171(92)90013-T","volume":"14","author":"G. McNulty","year":"1992","unstructured":"G. McNulty, A field guide to equational logic, J. Symbolic Computation, 14 (1992), pp. 371\u2013397.","journal-title":"J. Symbolic Computation"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"I. Simon, Limited subsets of a free monoid, in Proceedings of the 19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978), IEEE Computer Society, 1978, pp. 143\u2013150.","DOI":"10.1109\/SFCS.1978.21"},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0017135","volume-title":"Recognizable sets with multiplicities in the tropical semiring","author":"I. Simon","year":"1988","unstructured":"I. Simon, Recognizable sets with multiplicities in the tropical semiring, in Proceedings of Mathematical Foundations of Computer Science (Carlsbad, 1988), Lecture Notes in Computer Science 324, Springer-Verlag, 1988, pp. 107\u2013120."},{"key":"22_CR12","unstructured":"U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics 10, North-Holland, 1981."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:09:58Z","timestamp":1556719798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}