I came across this question in Peter-Linz today, Is the language L= { a^nb^n : n>=1 } U {b} deterministic ?

My doubt is that say we have a case like this {a^5 b^6} U {b}, after popping 5 a's from the stack for 5 b's how do we know that whether the last b is of {a^5 b^6} or {b}? So is it deterministic or non-deterministic?

  • 2
    $\begingroup$ You are reading set union wrong. $\endgroup$ – Raphael Jul 13 at 10:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.