290 views
1 votes
1 votes
If  L= set of all strings of 0's and 1's  where last two symbols are different.

My doubt is will the language include epsilon or not???

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
2
sripo asked Nov 6, 2018
3,031 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 votes
0 votes
0 answers
3
GateAspirant999 asked Dec 26, 2017
323 views
Let $L_1$ and $L_2$ are two languages and both of them are accepted by DPDA. If $L=L_1-L_2$ is any languange , then what is the smallest language family $L'$ belongs to?
2 votes
2 votes
2 answers
4
set2018 asked Nov 8, 2017
1,213 views
in this b,c,d all are true .how can we find the appropriate one ?