self doubt toc

Question

assume pda stack is limited to 210 symbols .now stack can contain maximum of 2^10 symbols The language Accepted by such pda is

a)regular lang but not finite

b)dcfl but not regular

c)cfl but not dcfl

d)non of these

actually my doubt is that pda with finite stack is equivalent to finite automata so it will accept regular language is fine but not finite how???

Answer 1

Finite automata means that it has the finite amount of memory ...so suppose here it is 2^10....so for every language we are not going to use the whole memory...sometimes we may use or may not.

for example,

the language which we can generate here is  1.(the string containing ab) or (string at least two a) or (string of 0* or 1* ) or (string of (0 + 1)*  ) ...........

so this all languages are regular but these can generate infinite strings in the language .....so not finite

Comments

THANK U

---

But it can also accept finite language if it is designed to(ex. accept only string “a” then why we are saying “not finite”??)