Construct a NFA and DFA state diagram that recognizes the following language : L = {w | w is a palindrome }
सुखार्थिनः कुतोविद्या नास्ति विद्यार्थिनः सुखम्।
Construct a NFA and DFA state diagram that recognizes the following language : L = {w | w is a palindrome }