Push-down Automata Construction

Question

Construct a push-down automata to recognize the language $ A = \{u\#v \in \{0,1,\#\}^{*} | u = v^{\complement} \} $. Here, $v^{\complement}$ is the bit-complement of v.

I don't see how to perform this with a LIFO stack. I would like some hints (not a solution) if possible.

Thanks,

score 3 · Accepted Answer · edited Apr 13 '17 at 12:48

3

There is no such PDA because $A$ is not context-free. This can be proved by pumping.

edited Apr 13 '17 at 12:48

Community

1

answered Feb 20 '17 at 07:55

nekketsuuu

987
6
20

Push-down Automata Construction

1 Answers1