| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434977 | Theoretical Computer Science | 2011 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
