This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Two Complete Axiom Systems for the Extended Language of Regular Expressions
July 1968 (vol. 17 no. 7)
pp. 700-701
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 F1presented 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.
Citation:
"Two Complete Axiom Systems for the Extended Language of Regular Expressions," IEEE Transactions on Computers, vol. 17, no. 7, pp. 700-701, July 1968, doi:10.1109/TC.1968.227424
Usage of this product signifies your acceptance of the Terms of Use.