Register

TOC Decidibility

106 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Parshu gate asked Nov 20, 2017
1,299 views
Countable languages in TOC
User Avatar
0 votes
0 votes
1 answer
2
amitarp818 asked Nov 18, 2023
238 views
Made easy TOC
Given L1 = {a*baa*} and L2 = {ab*} The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
User Avatar
0 votes
0 votes
2 answers
3
Pratik.patil asked Oct 30, 2023
407 views
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
User Avatar
3 votes
3 votes
2 answers
4
Jiten008 asked Oct 24, 2023
371 views
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
User Avatar
Link Copied!