Build automata based on a given regular language

28 Views Asked by At

Given $M$ which is a DFA for a regular language $L$, is it possible to build DFA/NFA for the language $$ L' = \{w \in L\:\:\text{s.t.}\:\: ww \in L \} $$ and if so then how?