Register
Filter

Questions by shreshtha5

0 votes
1 answer
41
plz answer..
0 votes
2 answers
42
plz answer !
consider the msg - aabbbbabccdddccccbbdd ques 1. the number of bits required for huffman encoding of the above msg is- a.38 b 30. c 42. d.46 ques 2. what is the decoded msg for 110100 1. abc 2 acb 3 bcd 4 bda
consider the msg -aabbbbabccdddccccbbdd ques 1. the number of bits required for huffman encoding of the above msg is-a.38 b 30. c 42. d.46 ques 2. what is t...
0 votes
1 answer
43
plz answer !
2 votes
3 answers
44
plz answer
the minimum number of states in the PDA accepting the language $L=\left\{a^n b^m \mid n>m;m,n>0 \right\}$ a) 2 b) 3 c) 4 d) 5
the minimum number of states in the PDA accepting the language$L=\left\{a^n b^m \mid n>m;m,n>0 \right\}$a) 2b) 3c) 4d) 5
1 votes
3 answers
45
Automata1.1
Let $L_1$ and $L_2$ be languages over $\Sigma$ and assume that $L_1 \cap L_2 = \phi$. if $L_1$ is finite language and $L_1 \cup L_2$ is regular then $L_2$ is ____ ? a. Regular language and finite b. Regular language and infinite c. Need not be regular d. None of these
Let $L_1$ and $L_2$ be languages over $\Sigma$ and assume that $L_1 \cap L_2 = \phi$. if $L_1$ is finite language and $L_1 \cup L_2$ is regular then $L_2$ is ____ ?a. Reg...
Page: