Question: A string w in {A; C; G; T}* is GC-dense if every substring of w of length at least four is GC-rich. (a) Show that
A string w in {A; C; G; T}* is GC-dense if every substring of w of length at least four is GC-rich. (a) Show that the set of GC-dense strings in {A; C; G; T}* is regular. (b) Produce a context-free grammar in Chomsky normal form to generate all GC-dense strings in {A; C; G; T}*.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
