Chomsky Hierarchy

How many types of Grammars are there in Chomsky Hierarchy

• 4

• 3

• 5

• 2

The language accepted by Unrestricted grammar

• Regular Language

• Recursively Enumerable Language

• Context Free Language

• Context Sensitive Language

Pick the automaton that accepts context-free language

• Turing Machine

• Finite Automata

• Push Down Automata

• Linear Bounded Automata

The language accepted by Turing Machine is

• Regular Language

• Context - Free Language

• Context - Sensitive Language

• Recursively enumerable language

Linear-bounded automaton accepts

• Context Sensitive Language

• Context Free Language

• Regular Language

• All languages