How can I describe a Push Down Automaton that recognize the language $P=\{a^{2^n} | n \geq 0 \}$?
My approach
I know that the language can be described by a Turing Machine, but how i can the stack recognize that language?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityHow can I describe a Push Down Automaton that recognize the language $P=\{a^{2^n} | n \geq 0 \}$?
My approach
I know that the language can be described by a Turing Machine, but how i can the stack recognize that language?