Abstract
In this paper we study an alternative way of treating Polish notation. Instead of proving unique reading for a well-behaved set of terms, we interpret any string of the alphabet in a monoid that extends, in a specifiable sense, the given algebra of functions.
Original language | English |
---|---|
Pages (from-to) | 3404-3411 |
Number of pages | 8 |
Journal | Theoretical Computer Science |
Volume | 412 |
Issue number | 28 |
DOIs | |
Publication status | Published - 20 Jun 2011 |
Keywords
- Algebra
- Monoid
- Polish notation
- Pushout
- Unique reading