Question: 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 " [ ] ".
0

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

Mumbai University > Information Technology > Sem 4 > Automata Theory

Marks : 10M

automata theory • 213 views
ADD COMMENTlink
modified 8 weeks ago by gravatar for RB RB100 written 5 months ago by gravatar for pratikj2208 pratikj22080
0

enter image description here

ADD COMMENTlink
modified 7 weeks ago by gravatar for Ankit Pandey Ankit Pandey60 written 8 weeks ago by gravatar for RB RB100
Please log in to add an answer.