Question: We consider alphabet E = {A; C; G; T}*. (This is the usual alphabet in which to write DNA sequences.) A string in E* is

We consider alphabet E = {A; C; G; T}*. (This is the usual alphabet in which to write DNA

sequences.) A string in E* is GC-rich if at least 60% of its symbols are G or C. Show that

the set of all GC-rich strings in E* is not regular.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!