please solve the problems(True/False questions)16. We can use the pumping lemma for context-free lan- guages to show that some language not to be regular 17. Pushdown autom

16. We can use the pumping lemma for context-free lan- guages to show that some language not to be regular 17. Pushdown automata with two stacks are as powerful as Turing machines. 18. Pushdown automata with a single queue is as powerful as Turing machines 19. The grammar STA bA| Ab | b, A > Aa a Т— Ab is in Chomsky Normal Form 20. The grammar X—аY | bҮ | с, S+аХbХ, Y X c has two nullable variables



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *