Issue No. 07 - July (1968 vol. 17)
Abstract?Two consistent and complete formal systems for the algebraic transformation of regular expressions involving intersections and complements are given. Both systems are extensions of the system F<inf>1</inf>presented in Salomaa . As a result, a method of eliminating intersections and complements from regular expressions is obtained. This solves a problem proposed by Eggan.
"Two Complete Axiom Systems for the Extended Language of Regular Expressions," in IEEE Transactions on Computers, vol. 17, no. , pp. 700-701, 1968.