Let M be a finite automaton. Define B = { yx | |x| = |y| and xyL(M) }. Show that B is context-free by providing an intuitivedescription of a PDA that accepts B.
Answer
Let M be a finite automaton. Define B = { yx | |x| = |y| and xyL(M) }. Show that B is context-free by providing an intuitivedescription of a PDA that accepts B.
Answer