Register

UGC NET CSE | June 2005 | Part 2 | Question: 9

• recategorized by
336 views

1 Answer

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

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Mar 26, 2020
437 views
UGC NET CSE | June 2005 | Part 2 | Question: 7
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to : $\overline{x}z$ $xyz$ $y$ $yz$
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to :$\overline{x}z$$xyz$$y$$yz$
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 26, 2020
1,366 views
UGC NET CSE | June 2005 | Part 2 | Question: 2
Identify the language which is not context – free. $L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$ $L=\left \{ ww\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{m}c^{m}d^{n}\mid n,m \geq 0 \right \}$
Identify the language which is not context – free.$L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$$L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$$L=\left \...
User Avatar
0 votes
0 votes
1 answer
4
go_editor asked Mar 26, 2020
1,305 views
UGC NET CSE | June 2005 | Part 2 | Question: 3
The transitive closure of a relation $R$ on set $A$ whose relation matrix $\begin{bmatrix} 0 & 1 & 0\\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{bmatrix}$ ... $\begin{bmatrix} 0 & 1 & 1\\ 0 & 1 & 1 \\ 0 & 1 & 1 \end{bmatrix}$
The transitive closure of a relation $R$ on set $A$ whose relation matrix $\begin{bmatrix}0 & 1 & 0\\ 0 & 0 & 1 \\ 1 & 0 & 0\end{bmatrix}$ is :$\begin{bmatrix}0 & 1 & 0\\...
User Avatar
Link Copied!