Interactive Algorithms for the Verification of the Equality between Complex and Simplified Boolean-Algebra Expressions in Digital Decoders | Zendy

Tochukwu Arinze Ikwunne | Zendy; Samuel Obiora Okide | Zendy

Open Access

Interactive Algorithms for the Verification of the Equality between Complex and Simplified Boolean-Algebra Expressions in Digital Decoders

Author(s) -

Tochukwu Arinze Ikwunne,

Samuel Obiora Okide

Publication year - 2020

Publication title -

review of computer engineering research

Language(s) - English

Resource type - Journals

eISSN - 2412-4281

pISSN - 2410-9142

DOI - 10.18488/journal.76.2020.71.27.37

Subject(s) - two element boolean algebra , boolean algebra , boolean expression , truth table , circuit minimization for boolean functions , boolean domain , computer science , complete boolean algebra , expression (computer science) , boolean algebras canonically defined , and inverter graph , free boolean algebra , table (database) , boolean network , standard boolean model , boolean circuit , algorithm , stone's representation theorem for boolean algebras , theoretical computer science , boolean function , algebra over a field , mathematics , programming language , algebra representation , data mining , pure mathematics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research