Blog: CS402 Finalterm Current Paper 2013 File 14

My paper of cs 402
Q 42: which is meant by “Prefixes” of language in another language?
Q 43: We can just use +,- symbol with start and final state ?in there another way to represent these state ?
Q 43: what type of production is allowed in CNF?
Q 44 :Make FA or Tm of some diagram
Q 45: Determine context free Grammar (CFG) responding to the following finite automata (FA)?
Q  46? Consider the context Free Grammar (CFG):
S                         bs/aa
Prove that it generates the language defined by the regular expression b*aa
Q 48) Conceder the language L of all strings defined over ={a,b}
Contain double 11 Draw Transition Graph (TG)for the given language
Q 50) write down the RE for the following languages:
a)Language L define over sigma =(0,1) having all possible string except null
b) Language L defined over sigma =90, 1) having “0110” anywhere in the string?
Q 51) explain the concept of unit production (s) in the context Free Grammar (CFG)?
Q 52) consider the following context Free Grammar (CFG) which is in the Chomsky normal form (CNF)
S AB
B BS/1
A 0
Draw derivation tree for 010101