Turing machine that accept L = {ww} in linearithmic time

162 Views Asked by At

I was wondering if there is a way to design a deterministic turing machine that accept the language L = {ww} with a time complexity of O(n log(n))