Describe a push-down automaton that can recognize the language L-Complement where L={WW|W belongs to sigma*}
I know the Context free grammar that generate the language and i know that i can convert a Context-free grammar into a push-down automaton.
but i want the idea behind the construction of the automaton.