Question

Suppose the alphabet is sigma = {a, b, ..., z, 0, 1, ..., 9,: }, i.e., the standard letters a-z, decimal numbers, and colon (: ). The colon is used as a delimiter between fields in a text file. Each line of the file thus corresponds to a string. a) Give a regular expression that accepts strings with four fields (i.e., with 3 delimiters). b) Give a regular expression that accepts strings where the second field is numerical. c) Give a regular expression that accepts strings where the third field is non-empty (a field is non-empty if it has at least one symbol). In tutorial 1, we discussed the DFA that determines whether a binary string is divisible by three or not. The state diagram is depicted below. Convert it to a corresponding regular expression.

Answer 1

Answer:-

」.(a) Ghen.onta SHesて Jel o stale be 2 J Stede be - go

92= 122402, Nole Avclen'A The or em Soted en the

Kindly Rate my Answer if you like and for query please comment :)