Home > ENGINEERING > COMPUTER > CS_TECHREP > 662
Shubhra Datta, The University of Texas at El PasoFollow Valeria Fierro, The University of Texas at El Paso Krasen Petrov, The University of Texas at El Paso Jessica Romo, The University of Texas at El PasoFollow Gesuri Ramirez, The University of Texas at El Paso Cesar Valenzuela, The University of Texas at El Paso
10-2010
Technical Report: UTEP-CS-10-45
Published in Journal of Uncertain Systems, 2011, Vol. 5, No. 2, pp. 84-89.
Properties like commutativity and associativity are very important in many applications. To make detecting these properties easier, it is desirable to reformulate them in the simplest possible way. A known way to simplify these descriptions is to use postfix notations, in which there is no need to use parentheses. We show that some of these properties can be further simplified if we represent them as equalities not between well-defined expressions, but as equalities between expression fragments.
DOWNLOADS
Since April 02, 2012
Computer Engineering Commons
Advanced Search
Comments
Technical Report: UTEP-CS-10-45
Published in Journal of Uncertain Systems, 2011, Vol. 5, No. 2, pp. 84-89.