Register

toc question explain please

238 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · resource allocation ...Next → · MadeEasy Test Series...
← Previous in category · Regular ExpNext in category → · self doubt
Position:
Show:

Related questions

2 2 votes
1 1 answer
2.4k
2.4k views
rahuljai asked Dec 13, 2018
2,440 views
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 and...
0 0 votes
1 1 answer
932
932 views
iarnav asked Sep 26, 2017
932 views
#TOC Someone please Explain this Gate Question
This is the Gate Question - https://gateoverflow.in/3392/gate2008-it-78?show=155376#c155376I couldn't help but understand the balanced parenthesis thing, I know, () this ...
3 3 votes
1 answers 1 answer
3.0k
3.0k views
Rajat Sharma 1 asked Dec 15, 2015
2,978 views
Please explain?
Consider the following Languages:$L_{ne}=\{\langle M \rangle \mid L(M)\neq \phi \}$$L_{e}=\{\langle M \rangle \ \mid L(M)=\phi \}$where $\langle M \rangle$ denotes encodi...
5 5 votes
1 answers 1 answer
2.5k
2.5k views
Shefali asked Sep 11, 2015
2,548 views
Which of the following is not a recursive Language? Please explain the reason for each
Which of the following is not a recursive language?a. Regular languageb. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$}c. {$\langle M \rangle$ | $M$ is a TM and ...