retagged by
696 views

1 Answer

1 votes
1 votes
From your question I can say that you are following some coaching material. Epsilon means empty string. $L = \{\epsilon\}$ is a language which has empty string in it (here no other strings) and we can draw a DFA for this making it a regular language. A regular language is by hierarchy a CFL, CSL, Recursive and also a recursively enumerable language. This also means epsilon is accepted by a PDA, LBA and also a Turing machine. How a TM accept an empty string is a better question.

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.