Among the following NFAs, which NFA is the resultant NFA transformed from S-aS|T TbTA?
The following empty stack PDA can be obtained from the grammar S->I c|aaSbb:
(0,a,a,pop,0,Rule1)
(0,b,b,pop,0,Rule2)
(0,c,c,pop,0,Rule3)
(0,S,pop,push,b,push,b,push,S,push,a,push,a,pop,0,Rule4)
(0,S,pop,0,Rule5)
(0,S,pop,push,c,pop,0,Rule6)
Which of the following sequences of PDA transitions will accept the string aacbb?
Rule4, Rule1, Rule1, Rule6, Rule3, Rule2, Rule2
Rule4, Rule1, Rule6, Rule3, Rule2, Rule1, Rule2
Rule4, Rule1, Rule1, Rule3, Rule1, Rule2
Rule4, Rule1, Rule1, Rule6, Rule3, Rule3, Rule2
Which of the four languages represents the Turing Machine with instructions:
(0,a,a,R,0)
(0,b,b,R,1)
(1,b,b,R,1)
(1,c,c,R,2)
(2,c,c,R,2)
(2,S,Halt)?