Design a PDA for CFL that check the well formedness of paranthesis i.e the language of all balanced string of two types of paranthesis ''( )" and " [ ] ".

5.7kviews

written 6.9 years ago by

pratikj2208 • 150

modified 5.7 years ago by

prashantsaini • 0

Trace the sequence of moves made corresponding to input string ( ( [ ] ) [ ] )

automata theory

ADD COMMENT EDIT

1 Answer

315views

written 6.6 years ago by

teamques10 ★ 70k

modified 6.6 years ago by

ankitpandey • 100

enter image description here

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.