DocumentCode :
1191342
Title :
Two Complete Axiom Systems for the Extended Language of Regular Expressions
Issue :
7
fYear :
1968
fDate :
7/1/1968 12:00:00 AM
Firstpage :
700
Lastpage :
701
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 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.
Keywords :
Equations;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1968.227424
Filename :
1687431
Link To Document :
بازگشت