I'm studying for my computing languages and I have some problem on getting the production rules from a push down automata.
The automaton accepts all strings over alphabet $\{e,k,q,y\}$ of the form $w\,kyyk\,w'$ such that $|w|=|w'|$.
There are the productions rules I get.
S -> QkyykK
Q -> qQ
Q -> yQ
Q -> eQ
Q -> kQ
Q -> epsilon
K -> Kq
K -> Ky
K -> Ke
K -> Kk
K -> epsilon
I don't understand how to have the same number on the left and on the right. Hope anyone can help me or explain me cause I am having so problems with that exercice. I use jflap for testing if it's accepted or rejected.