Abstract
This paper shows that the collection of identities in two variables which hold in the algebra N of the natural numbers with constant zero, and binary operations of sum and maximum does not have a finite equational axiomatization. This gives an alternative proof of the nonexistence of a finite basis for N—a result previously obtained by the authors.
Partially supported by grant no. T30511 from the National Foundation of Hungary for Scientific Research.
Supported by a research grant from the Danish Research Council.
Basic Research in Computer Science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Aceto, Z. Ésik, and A. Ingólfsdóttir, 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.
L. Aceto, Z. Ésik, and A. Ingólfsdóttir, 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.
J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, New York, 1981.
J. Gunawardena (ed.), Idempotency, Publications of the Newton Institute 11, Cambridge University Press, 1998.
K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. Comput. System Sci., 24 (1982), no. 2, pp. 233–244.
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–88.
W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science 5, Springer-Verlag, 1986.
G. McNulty, A field guide to equational logic, J. Symbolic Computation, 14 (1992), pp. 371–397.
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–150.
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–120.
U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics 10, North-Holland, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aceto, L., Ésik, Z., Ingólfsdóttir, A. (2000). On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive