search
Log In

Recent questions tagged languages-relationships

3 votes
1 answer
1
Given the recursively enumerable language $(L_{RE})$, the context sensitive language $(L_{CS})$, the recursive language $(L_{REC})$, the context free language $(L_{CF})$ and deterministic context free language $(L_{DCF})$ ... $L_{DCF} \subseteq L_{CF} \subseteq L_{CS} \subseteq L_{REC} \subseteq L_{RE}$
asked Aug 1, 2016 in Theory of Computation makhdoom ghaya 759 views
To see more, click for the full list of questions or popular tags.
...