Regular Expression : The language accepts by finite automata are easily described by simple expression called regular expression.
Regular expression operators are union , concatenation & closure/star.
Properties of regular expression :
- Faka Set is a regular expression & denotes the empty set.
- Epsilon is regular expression & denotes the set {Epsilon}
- For each a in . a is a regular expression & denotes the set {a}.If r & s are regular expressions denoting the language R & S. respectively, then (r+s). (rs) & (r*) are regular expressions that denotes the sets RUS, RS & R* respectively.
0 comments:
Post a Comment