Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with boolean-algebra
Search options not deleted
user 220744
In mathematics and mathematical logic, boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. Boolean algebra is used in the analysis and simplification of digital (logic) circuits
1
vote
1
answer
56
views
expressing a boolean function in another way
The following boolean expression is given:
g(p,q,r) = ((p->q') -> r)
Depict this boolean function only by using the operations ∧ (AND), v (OR), ¬ (NEGATION).
How can I do this?
I thought I could r …
- 17
0
votes
1
answer
169
views
Disjunctive Normal Form
The boolean expression:
y= (a'+b) * (b(c'+d')) = (a'+b) * (bc' + bd')
is given.
Find out the disjunctive normal form to this boolean expression.
My suggestion:
y= a'bc'd' + a'bc'd + a'bcd' + abc' …
- 17
0
votes
1
answer
125
views
The boolean expression from a circuit
Would the final boolean expression to the circuit be right? Or do I have to multiply the brackets b(c*d)' out to bc' + bd'
simulate this circuit – Schematic created using CircuitLab
Edit: My n …
- 17
-4
votes
1
answer
398
views
logic gates, implementation [duplicate]
Task: Draw an AND circuit with 8 inputs, a circuit which implements the expression a∧b∧c∧d∧e∧f∧g∧h.
Condition: Use only NOR-Gates with two inputs to solve this task.
Could anyone give me a hint, wha …
- 17