The Community for Technology Leaders
Green Image
ABSTRACT
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 [5]. As a result, a method of eliminating intersections and complements from regular expressions is obtained. This solves a problem proposed by Eggan.
INDEX TERMS
null
CITATION
"Two Complete Axiom Systems for the Extended Language of Regular Expressions", IEEE Transactions on Computers, vol. 17, no. , pp. 700-701, July 1968, doi:10.1109/TC.1968.227424
98 ms
(Ver )