Register
Filter

Recent questions without answers

1 votes
0 answers
4381
Made easy online test series toc
The no. Of state in minimal dfa for string starting with abb and ending with b over the alphabet a,b . Please construct dfa
The no. Of state in minimal dfa for string starting with abb and ending with b over the alphabet a,b .Please construct dfa
User Avatar
0 votes
0 answers
4384
Peter Linz Edition 4 Exercise 4.3 Question 25 (Page No. 124)
In the chain code language in Exercise 24, Section 3.1, let $L$ be the set of all $w ∈$ {$u,r,l,d$}$^*$ that describe rectangles. Show that $L$ is not a regular language.
In the chain code language in Exercise 24, Section 3.1, let $L$ be the set of all $w ∈$ {$u,r,l,d$}$^*$ that describe rectangles. Show that $L$ is not a regular languag...
User Avatar
0 votes
0 answers
4392
Made Easy Test Series :TOC1
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM? My question is what $y$ is accepting in TM? I mean why $y$ is needed? What language is accepted ?
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM?My question is what $y$ is ac...
User Avatar
0 votes
0 answers
4393
How to find precedence?
User Avatar
–1 votes
0 answers
4394
what is output
void fun(int,int*); int main() { int=-5,j=-2; fun(i,&j); print f(“i=%d j=%d\n”,i,j); return 0; } void fun(int i,int *j) { i=i*i; *j=*j * *j; }
void fun(int,int*);int main(){int=-5,j=-2;fun(i,&j);print f(“i=%d j=%d\n”,i,j);return 0;}void fun(int i,int *j){i=i*i;*j=*j * *j;}
User Avatar
0 votes
0 answers
4395
linear programming
User Avatar
1 votes
0 answers
4396
problem on back edge
Can someone provide good example to illustrate cross edge,back edge ,forward edge?
Can someone provide good example to illustrate cross edge,back edge ,forward edge?
User Avatar
0 votes
0 answers
4403
Ullman (TOC) Edition 3 Exercise 7.4 Question 5 (Page No. 308)
Modify the $CYK$ algorithm to report the number of distinct parse trees for the given input, rather than just reporting membership in the language$.$
Modify the $CYK$ algorithm to report the number of distinct parse trees for the given input, rather than just reporting membership in the language$.$
User Avatar
0 votes
0 answers
4404
Ullman (TOC) Edition 3 Exercise 7.4 Question 4 (Page No. 308)
Show that in any $CNF$ grammar all parse trees for strings of length $n$ have $2n-1$ interior nodes $(i.e.,$ $2n-1$ nodes with variables for lables$).$
Show that in any $CNF$ grammar all parse trees for strings of length $n$ have $2n-1$ interior nodes $(i.e.,$ $2n-1$ nodes with variables for lables$).$
User Avatar
0 votes
0 answers
4405
Ullman (TOC) Edition 3 Exercise 7.4 Question 3 (Page No. 308)
Using the grammar $G$ of Example $7.34,$use the $CYK$ algorithm to determine whether each of the following strings is in $L(G):$ $ababa$ $baaab$ $aabab$
Using the grammar $G$ of Example $7.34,$use the $CYK$ algorithm to determine whether each of the following strings is in $L(G):$$ababa$$baaab$$aabab$
User Avatar
0 votes
0 answers
4408
Ullman (TOC) Edition 3 Exercise 7.3 Question 7 (Page No. 299)
Complete the proof of theorem $7.27$ by showing that $(q_{P},w,Z_{0})\vdash(q,\in,\gamma)$ if and only if $(q_{P},q_{A},w,Z_{0}) \vdash((q,p),\in,\gamma),$ where $p =\hat{\delta}(p_{A},w).$
Complete the proof of theorem $7.27$ by showing that$(q_{P},w,Z_{0})\vdash(q,\in,\gamma)$ if and only if $(q_{P},q_{A},w,Z_{0}) \vdash((q,p),\in,\gamma),$ where $p =\hat...
User Avatar
Page: