Unit – 6

1 Explain types of regular grammar.

2 Define the following terms:
a) Constant function
b) Initial function
c) Bounded existential quantification
d) Bounded universal quantification
e) Successor function
f) Projection function
g) Initial function
3 Justify: If L is a recursive language over Σ, then its complement L’ is also recursive.
4 Justify: Every recursive language is recursively enumerable.
5 Explain Context Sensitive language. Write a name of machine that accepts CSL
6 Explain context sensitive grammar.
7 Explain phrase-structure grammar.
8 Define unrestricted grammar.
9 Explain type-0, type-1, type-2, type-3 grammar.
10 Explain recursively enumerable language.
11 Explain Chomsky hierarchy.
12 Explain composition.
13 Match following:
Unrestricted Remunerable Language Linear - bounded Automation
Regular Language Pushdown Automation
Context Free Language Turing Machine
Context Sensitive Language Finite Automation
14 Enlist computable functions.
15 Identify the types of following grammars:
X → aY X→YXa SP → aPbS
Y→a X→a S→a
Y→b|∧ P→b
AB→AbBc S→ aS S→AcaB
A → bcA S→bA Bc→acB
B→b A→a | cA cB→DB
aD→Db
16 Differentiate initial and composition functions.
17 Explain primitive recursive functions.
18 Define linear bounded automata.
19 How does Turing machine enumerate a language?