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.2kviews

written 5.9 years ago by

pratikj2208 • 140

modified 4.7 years ago by

prashantsaini • 0

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

automata theory

ADD COMMENT EDIT

1 Answer

298views

written 5.6 years ago by

teamques10 ★ 68k

modified 5.6 years ago by

ankitpandey • 100

enter image description here

ADD COMMENT EDIT

Please log in to add an answer.