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 • 10 views
ADD COMMENTlink
written 4 days ago by gravatar for abhishektiwari1712 abhishektiwari1712 ♦♦ 0
Please log in to add an answer.