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

written 7.3 years ago by

alemnewmirkuzie3 • 0

modified 6.1 years ago by

parviagrawal100 • 0

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

automata theory

ADD COMMENT EDIT

1 Answer

315views

written 7.0 years ago by

teamques10 ★ 70k

modified 7.0 years ago by

tusharghangas1 • 0

enter image description here

ADD COMMENT EDIT

Please log in to add an answer.