Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-sensitive-languages
0
votes
3
answers
1
CFL or CSL
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.
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.
!KARAN
1.8k
views
!KARAN
asked
Jan 17, 2019
Theory of Computation
theory-of-computation
context-free-language
context-sensitive-languages
+
–
2
votes
2
answers
2
MadeEasy Test Series: Theory Of Computation
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none
(a^n)^m b^n where n>=0 and m>1 isa) regularb) cflc) csld) none
♥_Less
600
views
♥_Less
asked
Jan 29, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
context-free-language
context-sensitive-languages
+
–
4
votes
0
answers
3
Are CSL, RE, Recursive languages closed under Subset operation?
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 subset of anbnc* which is non-cfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?
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...
yg92
2.8k
views
yg92
asked
Feb 8, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
context-sensitive
context-sensitive-languages
closure-property
+
–
0
votes
1
answer
4
CSL Questions
L= { a^m b^n | m^2 + n^2 = 16} how is this language a CSL? Reason with explanations please?
L= { a^m b^n | m^2 + n^2 = 16} how is this language a CSL? Reason with explanations please?
Subin
382
views
Subin
asked
Nov 18, 2016
Theory of Computation
context-sensitive-languages
+
–
3
votes
2
answers
5
CFL or CSL ?
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
kanahanin
1.8k
views
kanahanin
asked
Dec 8, 2015
Theory of Computation
theory-of-computation
context-free-language
context-sensitive-languages
+
–
9
votes
3
answers
6
Does CSL Contains Empty String ?
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, ... -> a^nb^nc^n , n >=0, where this is CSL or Not ? This language contains empty string too !
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 refe...
Akash Kanase
2.6k
views
Akash Kanase
asked
Nov 25, 2015
Theory of Computation
theory-of-computation
context-sensitive-languages
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register