Theory if Computation Problem

20 Views Asked by At

Hey I am having a hard time trying to make an implementation of a TM (Turing Machine) that describes a list of n strings over {a,b,c,...,z} of max 2n each have a character common to all. Then on top of that, I have to make a complexity class for the TM in terms of n... I don't really know where to start