Every regular language can be produced by context free grammar and context free language can be produced by context sensitive grammar and so on.
Find the context sensitive language from the given diagram
C1: For DFA (?, ?, ?, qo, F),
if F = ?, then L = ?*
C2: For NFA (?, ?, ?, qo, F),
if F = ?, then L = ?*
Where F = Final states set
? = Total states set
