Regular Expressions and DFAs
Regular Expression. Notation to specify a set of strings. . Examples. . . Exercise 1. Let? be a finite set of symbols? = {10, 11},?* = ?. Answer. Answer: ?* = {?, 10, 11, 1010, 1011, 1110, 1111, }. Exercises2. Let? be a finite set of symbols and let L, L1, and L2 be sets of strings from ?*. L
480 views • 36 slides