0 0 votes What is the Language represented by this {a^i b^j c^k} where j>i+k ? Theory of Computation theory-of-computation + – shekhar chauhan 983 views answer comment Share Follow Print See 1 comment 1 1 comment reply Kapil commented Jun 15, 2016 reply Follow flag Context free language 0 0 replyShare Please log in or register to add a comment.
0 0 votes L={a^i b^j c^k} where j>i+k S⟶S1S2S3 S1⟶aS1b /∊ S2⟶bS2 / b S3 ⟶ bS3c /∊ So, this is also a CFL srestha answered Jun 15, 2016 srestha comment Share Follow See all 4 Comments 4 4 Comments reply shekhar chauhan commented Jun 17, 2016 reply Follow flag Can you please elaborate how we are going to process the strings of this language using PDA .when we are going to push the string into the stack and when we are going to pop off them. 0 0 replyShare Praveen Saini commented Jun 18, 2016 reply Follow flag Push $a's$ in stack, Read $b's$ Pop $a's$ from stack, on getting stack empty, push remaining $b's$ in stack, Read $c's$ Pop $b's$ from stack, When input get ends, $b's$ should be left in stack. 5 5 replyShare shekhar chauhan commented Jun 18, 2016 reply Follow flag it must be deterministic rt ? 0 0 replyShare srestha commented Jun 18, 2016 reply Follow flag yes deterministic CFL 1 1 replyShare Please log in or register to add a comment.
