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

Authors:
Luca Aceto;Zoltán Ésik;Anna Ingólfsdóttir
Affiliations:
-;-;-
Venue:
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2000

Citing 6
Cited 3

Semirings, automata, languages

Semirings, automata, languages
Relative star height, star height and finite automata with distance functions

Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Process algebra

Process algebra
A field guide to equational logic

Journal of Symbolic Computation
Recognizable Sets with Multiplicities in the Tropical Semiring

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Limited subsets of a free monoid

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

2-Nested Simulation Is Not Finitely Equationally Axiomatizable

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatizing Tropical Semirings

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Bisimilarity is not finitely based over BPA with interrupt

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.