Dark Mode

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.

!KARAN asked in Theory of Computation Jan 17, 2019

by !KARAN

1.8k views

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

♥_Less asked in Theory of Computation Jan 29, 2018

592 views

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?

yg92 asked in Theory of Computation Feb 8, 2017

by yg92

2.7k views

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?

Subin asked in Theory of Computation Nov 18, 2016

by Subin

378 views

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?

kanahanin asked in Theory of Computation Dec 8, 2015

1.7k views

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 !

Akash Kanase asked in Theory of Computation Nov 25, 2015

by Akash Kanase

2.6k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged context-sensitive-languages