2 Construct a PDA that accepts L where L aibjck ij or ik f
2. Construct a PDA that accepts L, where L = {aibjck | i=j or i=k for i> 0}. Is this PDA deterministic? Why or why not?
Solution
This PDA is not deterministic because PDA can only store two variables at a time but in this language three variables are given and it is hard to remeber all these variables for PDA.
Strings generated by the given language are: { abc,aabbc,aabcc, aaabbbcc,.... etc}
