1. Consider the following language: A = {x0 | x E {0, 1}* and x contains...

   

Transcribed Image Text:

1. Consider the following language: A = {x0 | x E {0, 1}* and x contains any combination of substrings 11 or 110} 1a) Write the simplest string in A. 1b) Construct an NFA N such that A = L(N). Do not exceed 5 states. 1c) Convert N to DFA using the subset construction process. 1. Consider the following language: A = {x0 | x E {0, 1}* and x contains any combination of substrings 11 or 110} 1a) Write the simplest string in A. 1b) Construct an NFA N such that A = L(N). Do not exceed 5 states. 1c) Convert N to DFA using the subset construction process.