# context sensitive language

1 vote
417 views
L = { ${\epsilon }$ } is a

a) regular

b) CFL

c) CSL

d) recursive language

edited

L = ϵ is nothing but Null string if we draw the DFA the first state is final

It is Perfectly Regular and since it i Regular according to chomsky hierarchy it is CFL,CSL,Recursive

selected
1
Then it is also recursive. rt?
But epsilon is not accepted by a TM. Why?
0
0
does it imply that TM or LBA can be built to accept  L = {ϵ}
0

TM is nothing but Finite State Machine with 2 extra stack

If  Finite State Machine + 1 Stack =PDA

Finite State Machine +2 stack =TM

So it is perfectly alright to say it is regular and since we can built a DFA so obviously yes TM can be build to accept  ϵ

## Related questions

1
2.2k views
Context sensitive grammar can be recognised by A)finite state automata B)2 way linear bounded automata C)Pushdown automata D)None of these
How can I tell if languages $L_1$ and $L_2$ are Context Sensitive or not?