<--- Back to Details
First PageDocument Content
Electronic design automation / Electronic design / Logic in computer science / Algebraic logic / Logic synthesis / Combinational logic / Canonical form / Boolean algebra / Karnaugh map / Electronic engineering / Digital electronics / Design
Date: 2013-09-24 15:54:27
Electronic design automation
Electronic design
Logic in computer science
Algebraic logic
Logic synthesis
Combinational logic
Canonical form
Boolean algebra
Karnaugh map
Electronic engineering
Digital electronics
Design

ECE 102: Digital Circuit Logic

Add to Reading List

Source URL: www.engr.colostate.edu

Download Document from Source Website

File Size: 23,71 KB

Share Document on Facebook

Similar Documents

HP 35s Scientific Calculator Get professional performance from the ultimate RPN scientific programmable calculator. Switch between RPN* and algebraic entry-system logic at any time. The HP 35s features

DocID: 1uXjF - View Document

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, An Algebraic Approach to Dynamic Epistemic Logic Prakash Panangaden1 , Caitlin Phillips1 , Doina Precup1 , and Mehrnoosh Sadr

DocID: 1tdJ8 - View Document

Games in algebraic logic: axiomatisations and beyond Robin Hirsch and Ian Hodkinson Department of Computer Science, University College London, UK Department of Computing, Imperial College London, UK March 6, 2005

DocID: 1t7HB - View Document

Mathematics / Logic / Mathematical logic / Algebraic structures / Model theory / Z notation / Topology / S / Set theory / Lattice / Ring / Axiom

Efficient Reasoning with Range and Domain Constraints Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov|horrocks}@cs.man.ac.uk

DocID: 1rnPM - View Document

Logic / Constraint programming / Constraint satisfaction problem / Model theory / Abstraction / Philosophy / Constraint satisfaction / Satisfiability / Algebraic structure

CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

DocID: 1rm3f - View Document