Advertisement

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers

  • Luca Aceto
  • Zoltán Ésik
  • Anna Ingólfsdóttir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)

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.

Keywords

Partial Order Equational Theory Axiom System Free Algebra Constant Zero 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    J. Baeten and W. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.Google Scholar
  4. 4.
    S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, New York, 1981.zbMATHGoogle Scholar
  5. 5.
    J. Gunawardena (ed.), Idempotency, Publications of the Newton Institute 11, Cambridge University Press, 1998.Google Scholar
  6. 6.
    K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. Comput. System Sci., 24 (1982), no. 2, pp. 233–244.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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.CrossRefGoogle Scholar
  8. 8.
    W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science 5, Springer-Verlag, 1986.Google Scholar
  9. 9.
    G. McNulty, A field guide to equational logic, J. Symbolic Computation, 14 (1992), pp. 371–397.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics 10, North-Holland, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Luca Aceto
    • 1
  • Zoltán Ésik
    • 2
  • Anna Ingólfsdóttir
    • 2
  1. 1.BRICS, Department of Computer ScienceAalborg UniversityAalborg ØDenmark
  2. 2.Department of Computer ScienceA. József UniversitySzegedHungary

Personalised recommendations