Does CSL contains empty string ? I've got contradictory statements from various sources.
Can someone for sure say whether empty string is CSL or not ! Please give the reference.
My source -> Page no 292, Chapter 11 A Hierarchy of Formal Languages & LBA, Peter linz -An Introduction To Finite Automata, 5th Edition
"A language L is said to be CSL if there exists context sensite grammar G such that L = L(G) or L = L(G) U {
}" So Language contains empty string & Grammar does not ! as per Peter Linz "
Here 
means empty string.
Example ->
a^nb^nc^n , n >=0, where this is CSL or Not ? This language contains empty string too !