Register

made east bt4

282 views
0 votes
0 votes

User Avatar

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
Harshit Bajpai asked Jan 15, 2019
798 views
made easy bt4
For a given language over (0,1)* ,we define the operation init(L) as, init(L)={u |uv ϵ L for some v in {0,1}* } let L1 = {w |w ϵ (0,1)* ,n0(w)=n1(w) } Let X denote the language accepted by init(L1). Then the number of states in the minimal DFA of X is equal to________ I could not understand question . please help to solve it
For a given language over (0,1)* ,we define the operation init(L) as,init(L)={u |uv ϵ L for some v in {0,1}* }let L1 = {w |w ϵ (0,1)* ,n0(w)=n1(w) } Let X denote the la...
User Avatar
0 votes
0 votes
0 answers
2
Harshit Bajpai asked Jan 17, 2019
206 views
made east test
User Avatar
0 votes
0 votes
1 answer
4
Harshit Bajpai asked Jan 17, 2019
377 views
made east mock 2
User Avatar
Link Copied!