2. a) Write regular expressions/definitions for the following languages: i) All strings continuing no more than...

Transcribed Image Text:

2. a) Write regular expressions/definitions for the following languages: i) All strings continuing no more than three a's over alphabet {a,b,c}. ii) The set of strings of 0's and I's whose number of 0's is divisible by three and whose number of 1's is odd. iii) All string of digits with at most one repeated digit. b) Convert the following NFA to DFA. Start 90 0 91 92 0,1 0,1 c) Sketch a brief argument for why any regular language can be recognized by an NFA. (09) (14) (07) 2. a) Write regular expressions/definitions for the following languages: i) All strings continuing no more than three a's over alphabet {a,b,c}. ii) The set of strings of 0's and I's whose number of 0's is divisible by three and whose number of 1's is odd. iii) All string of digits with at most one repeated digit. b) Convert the following NFA to DFA. Start 90 0 91 92 0,1 0,1 c) Sketch a brief argument for why any regular language can be recognized by an NFA. (09) (14) (07)

Answer rating: 100% (QA)

3 RE over symbols ab that contain at most 2 ... View the full answer