1 votes 1 votes How to we know that the given language is implemented by one stack or two in cfl??? Madhu kumar Tandon asked Nov 23, 2016 Madhu kumar Tandon 194 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes one stack means a machine is a PDA two stacks means the machine is Turing viv696 answered Nov 24, 2016 viv696 comment Share Follow See all 0 reply Please log in or register to add a comment.