Second Stage Computational Theory Dr.

Ghiath Hameed
Ex. Let G(L) = ({S, B, C}, {a, b, c}, P, S) , and the P denoted as:

S  aSBC / aBC
CB  BC
aB  ab
bB  bb
bC  bc
cC  cc

Is the string "a2b2c2" accepted for the G(L) or not?

Sol.
S  aSBC by using S  aSBC
 a aBCBC by using S  aBC
 aabCBC by using aB  ab
 aa bBCC by using CB  BC
 aabbCC by using Bb  bb
 aabbcC by using bC  bc
 aabbcc by using cC  cc
 the string "a b c " is accepted.
2 2 2

H.W. Let G(L) = ({ S, B, C} , {a, b, c}, P,S) where P denoted as: 

S  aSBC / aBC
aB  ab
CB  BC
  bB  bb  

bC  bc
cC  cc
1- is the string "aabcc" Accept or not ?
2- is the string " abc" Accept or not ?
3- is the string " a3 b3 c3 " Accept or not ?

13 
 
Second Stage Computational Theory Dr. Ghiath Hameed
ChomiskyHierachy ‫ھرم چومسكي‬

Chomisky classify language grammar into FOUR types:

1. Type (0) (Non-Restricted Grammar)

u  v , u, v  ( N  t ) * , (Turing Machine (TM)) ‫من تطبيقاتھا‬
2. Type (1) (Context Sensitive Grammar)
u  v , u, v  ( N  t )  , (Push-Down Automata (PDA)) ‫ومن تطبيقاتھا‬
3. Type (2) (Context Free Grammar)
N  V , N  nonterminal, V  ( N  T ) * , (Finite Automata (FA)) ‫ومن تطبيقاتھا‬
4. Type (3) (Regular Grammar) of (Linear Grammar)
N  tN / t , (Regular Expression) ‫ومن تطبيقاتھا‬

14