18. For the alphabet E = {a, b}, give regular expression for the following languages: a) L1 = All strings. b) L2 = All strings except empty string. c) L3 = All strings starting with ab. d) La = All...

Subject: theory of computer science Please answer only : e, f, g


Extracted text: 18. For the alphabet E = {a, b}, give regular expression for the following languages: a) L1 = All strings. b) L2 = All strings except empty string. c) L3 = All strings starting with ab. d) La = All strings ending with ab. e) Ls = All strings that begin AND end with ab f) L6 = All strings that begin OR end with ab 8) L7 = All strings that contain the substring ab %3D %3D h) Lg = All strings that contain the substring ba i) L9 = All strings that contain the substring ab or ba j) L10 = All strings that contain the substring ab and ba k) L11 = All strings containing exactly two a's. %3D I) L12 = All strings containing at least two a's.