1,483 views
2 votes
2 votes
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?

1 Answer

1 votes
1 votes

 L = {an | n>=1 } will have strings like - 

L = {a, aa, aaa, aaaa . . ..  } and which is expressed as RegEx = a+

Since we are able to give RegEx, therefore L is regular Language and every Regular Langugae is DCFL and we need DPDA to accept it.

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
2 answers
2
ggwon asked Dec 29, 2022
701 views
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?
1 votes
1 votes
2 answers
4
atulcse asked Jan 21, 2022
677 views
Is the following language a DCFL? Please explain your reasoning.