Which of the following relates to Chomsky hierarchy? (options are in decreasing order) Options : CSL Unrestricted CFL Regular CFL CSL Unrestricted Regular Regular CFL CSL Unrestricted None of the mentioned

The correct answer is "Regular CFL CSL Unrestricted". This order is based on the Chomsky hierarchy, which classifies different types of formal grammars.

Here's a step-by-step explanation:

1. Regular: This is the simplest type of language in the Chomsky hierarchy. It's generated by regular grammars, which are used to define regular languages. These languages can be recognized by a finite state machine.

2. Context-Free Language (CFL): This is a bit more complex than regular languages. It's generated by context-free grammars, which are used to define context-free languages. These languages can be recognized by a pushdown automaton.

3. Context-Sensitive Language (CSL): This is more complex than context-free languages. It's generated by context-sensitive grammars, which are used to define context-sensitive languages. These languages can be recognized by a linear-bounded non-deterministic Turing machine.

4. Unrestricted: This is the most complex type of language in the Chomsky hierarchy. It's generated by unrestricted grammars, which are used to define recursively enumerable languages. These languages can be recognized by a Turing machine.

So, the correct order from simplest to most complex is Regular, CFL, CSL, Unrestricted.