• retagged by
3,678 views
9 9 votes

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 { \epsilon\!}" So Language contains empty string & Grammar does not ! as per Peter Linz "

Here \epsilon\!

means empty string.

Example ->

a^nb^nc^n , n >=0, where this is CSL or Not ? This language contains empty string too !

3 Answers

7 7 votes
Yes, it is CSL. Because empty string must be a regular language. When a string is regular and also finite, it also satisfies higher properties like CFL, CSL and also recursive

∊⊂ finite ⊂ regular ⊂ CFL ⊂ CSL.
1 1 vote
Yes, CSL do contain empty string.
But with restriction that only the production of the form S->e are valid and S should not occur on the right hand side of any production (in this case). Just to include, empty string in the grammar, this production is used.
0 0 votes
i guess yes it does. even it accepts production like S->epsilon but S should not appear right side of any production.
Position:
Show:

Related questions

0 0 votes
3 3 answers
2.4k
2.4k views
!KARAN asked Jan 17, 2019
2,371 views
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$How do we prove that this language is not CFL.
4 4 votes
0 0 answers
3.6k
3.6k views
yg92 asked Feb 8, 2017
3,554 views
Regular languages are not closed under Subset - Example anbn is subset of a*b* which is non-regular.DCFL/CFL languages are not closed under Subset - Example anbncn is su...
3 3 votes
2 answers 2 answers
2.4k
2.4k views
kanahanin asked Dec 8, 2015
2,409 views
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
0 0 votes
1 answers 1 answer
761
761 views
Subin asked Nov 18, 2016
761 views
L= { a^m b^n | m^2 + n^2 = 16} how is this language a CSL? Reason with explanations please?