Theory of Computation

Type 0 Grammar of Chomsky hierarchy is called as ___________>

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Type 1 Grammar of Chomsky hierarchy is called as ___________>

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Type 2 Grammar of Chomsky hierarchy is called as ___________>

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Type 3 Grammar of Chomsky hierarchy is called as ___________>

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Grammar which has no rules on the productions are called as ___________.

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Grammars in which the LHS is restricted to a single non terminal are called as ___________

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

Grammar in which the length of RHS is restricted to atmost two is called as ___________

• Unrestricted Grammar

• Regular Grammar

• Context Free Grammar

• Context Sensitive Grammar

The automata which accepts context sensitive grammar is called as ____________.

• Push Down Automata (PDA)

• Turing Machine (TM)

• Linear Bounded Automata (LBA)

• Finite Automata (FA)

The automata which accepts context free grammar is called as ____________.

• Push Down Automata (PDA)

• Turing Machine (TM)

• Linear Bounded Automata (LBA)

• Finite Automata (FA)

The language accepted by Turing Machine is called as _____________.

• Context Free Langugae

• Regular Language

• Recursively Enumerable Language

• Context Sensitive Language