Aplikace znázorňující minimalizaci logických výrazů pomoci Karnaughovy mapy

Abstract

This thesis is about minimalization of logical function by the grafic method called Karnaugh map. It describes what these maps are, how these maps work and when and where they can be used. In second part of thesis I describe how the application is written and how it demonstrates minimalization of logical expressions by Karnaugh map. At the end of this thesis I solve how to make application faster by running program in paralel threads.