Register
Filter

Recent questions without an upvoted answer

2 votes
0 answers
8255
Ullman (TOC) Edition 3 Exercise 2.5 Question 2 (Page No. 79)
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton to a DFA.
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton t...
User Avatar
0 votes
0 answers
8256
Ullman (TOC) Edition 3 Exercise 2.5 Question 1 (Page No. 79)
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton to a DFA.
Consider the following $\in-NFA.$Compute the $\in-$closure of each state.Give all the strings of length three or less accepted by the automaton.Convert the automaton to a...
User Avatar
0 votes
0 answers
8259
Morris Mano Edition 3 Exercise 5 Question 19 (Page No. 199)
Rearrange the truth table for the circuit in the figure and verify it can function as demultiplexerr.
Rearrange the truth table for the circuit in the figure and verify it can function as demultiplexerr.
User Avatar
1 votes
0 answers
8260
Morris Mano Edition 3 Exercise 5 Question 18 (Page No. 199)
Construct a $5 \times 32 $ decoder with four $3\times8$ decoders with enable and one $ 2 \times 4$ decoder. use a block diagram also.
Construct a $5 \times 32 $ decoder with four $3\times8$ decoders with enable and one $ 2 \times 4$ decoder. use a block diagram also.
User Avatar
0 votes
0 answers
8263
Morris Mano Edition 3 Exercise 5 Question 15 (Page No. 199)
A combinational circuit is defined by the following three boolean functions. Design a circuit with a decoder and External Gate. F1 = x’y’z’ + xz F2 = xy’z’ + x’y F3 = x’y’z + xy
A combinational circuit is defined by the following three boolean functions. Design a circuit with a decoder and External Gate.F1 = x’y’z’ + xzF2 = xy’z’ + x’...
User Avatar
0 votes
0 answers
8264
Morris Mano Edition 3 Exercise 5 Question 14 (Page No. 199)
Design a BCD to Decimal decoder using the unused combinations of the BCD code as don’t care conditions.
Design a BCD to Decimal decoder using the unused combinations of the BCD code as don’t care conditions.
User Avatar
0 votes
0 answers
8265
Morris Mano Edition 3 Exercise 5 Question 13 (Page No. 199)
Design a combinational circuit that compares two 4-bit numbers A and B to check if they are equal. the Circuit has one output x, so that when x = 1 if A = B and x = 0 if A and B is not equal.
Design a combinational circuit that compares two 4-bit numbers A and B to check if they are equal. the Circuit has one output x, so that when x = 1 if A = B and x = 0 if ...
User Avatar
0 votes
0 answers
8267
Morris Mano Edition 3 Exercise 5 Question 11 (Page No. 198)
Construct a 4-digit BCD adder-subtractor using 4 BCD adders. Use the Block diagram for each component, showing only inputs and outputs.
Construct a 4-digit BCD adder-subtractor using 4 BCD adders. Use the Block diagram for each component, showing only inputs and outputs.
User Avatar
0 votes
0 answers
8270
Morris Mano Edition 3 Exercise 5 Question 8 (Page No. 198)
Derive the two-level Boolean expression for the output carry $C _5$ shown in the look-ahead carry generator of the figure
Derive the two-level Boolean expression for the output carry $C _5$ shown in the look-ahead carry generator of the figure
User Avatar
0 votes
0 answers
8271
Made easy work book
User Avatar
0 votes
0 answers
8279
Ullman (TOC) Edition 3 Exercise 2.3 Question 7 (Page No. 68)
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence $w$ if and only if the $i^{th}$ symbol from the end of $w$ is $1.$Prove this claim.
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence$w$ if and only if the $i^{th}$ symbol from the end ...
User Avatar
Page: