Question

1. The alphabet for generating DNA sequences is {A, T, G, C}. Write a regular expression that represents all DNA strings that begin with ‘A’ and end with ‘T’. Note: assume empty string is not a valid string.

2. Please submit the regular expression and Diagram of the DFA.

I will be creating C++ code that extracts patterns that begin with 'A' and end with 'T' , but I need help with the visual representation. Thank you!

example Input: CATTGCAGGTG

matching patterns are:

AT, ATT, ATTT, ATTTGCAGGT, AGGT

Answer 1

Note :if you have any queries please post a comment thanks a lot..always available to help you