How to identify whether given CFL is either Deterministic or Non-Deterministic?
I am getting confused here.
I have analysed the above problem like this,
DCFL - DPDA - If we are sure about when to push an input alphabet to stack and pop from a stack.
NDCFL - NPDA - We are not sure about when to push and pop from the stack.
If my understanding is wrong, please correct me.
Is L = {a^n | n>=1 } is NPDA or PDA?