\relax 
\ifx\hyper@anchor\@undefined
\global \let \oldcontentsline\contentsline
\gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global \let \oldnewlabel\newlabel
\gdef \newlabel#1#2{\newlabelxx{#1}#2}
\gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\let \contentsline\oldcontentsline
\let \newlabel\oldnewlabel}
\else
\global \let \hyper@last\relax 
\fi

\select@language{english}
\@writefile{toc}{\select@language{english}}
\@writefile{lof}{\select@language{english}}
\@writefile{lot}{\select@language{english}}
\select@language{czech}
\@writefile{toc}{\select@language{czech}}
\@writefile{lof}{\select@language{czech}}
\@writefile{lot}{\select@language{czech}}
\@writefile{toc}{\contentsline {chapter}{\numberline {1}\IeC {\'U}vod}{1}{chapter.1}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {1.1}\IeC {\'U}vod do problematiky}{1}{section.1.1}}
\@writefile{toc}{\contentsline {section}{\numberline {1.2}C\IeC {\'\i }le pr\IeC {\'a}ce}{1}{section.1.2}}
\@writefile{toc}{\contentsline {section}{\numberline {1.3}Implementa\IeC {\v c}n\IeC {\'\i } po\IeC {\v z}adavky na \IeC {\v r}e\IeC {\v s}en\IeC {\'\i }}{1}{section.1.3}}
\@writefile{toc}{\contentsline {section}{\numberline {1.4}Rozd\IeC {\v e}len\IeC {\'\i } textu na kapitoly}{2}{section.1.4}}
\@writefile{toc}{\contentsline {chapter}{\numberline {2}Definice}{3}{chapter.2}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {2.1}Opakov\IeC {\'a}n\IeC {\'\i } pojm\IeC {\r u}}{3}{section.2.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.1}Booleova algebra}{3}{subsection.2.1.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.2}Vyj\IeC {\'a}d\IeC {\v r}en\IeC {\'\i } logick\IeC {\'y}ch funkc\IeC {\'\i }}{4}{subsection.2.1.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.3}Pou\IeC {\v z}\IeC {\'\i }van\IeC {\'e} d\IeC {\r u}le\IeC {\v z}it\IeC {\'e} term\IeC {\'\i }ny}{4}{subsection.2.1.3}}
\@writefile{toc}{\contentsline {section}{\numberline {2.2}Operace pro dekompozici term\IeC {\r u}}{5}{section.2.2}}
\newlabel{sec:sharp}{{2.2}{5}{Operace pro dekompozici termů\relax }{section.2.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces P\IeC {\v r}\IeC {\'\i }klad pou\IeC {\v z}it\IeC {\'\i } operace Sharp}}{6}{figure.2.1}}
\newlabel{fig:sharp_operation}{{2.1}{6}{Příklad použití operace Sharp\relax }{figure.2.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces P\IeC {\v r}\IeC {\'\i }klad pou\IeC {\v z}it\IeC {\'\i } operace Disjoint sharp}}{6}{figure.2.2}}
\newlabel{fig:disjointsharp_operation}{{2.2}{6}{Příklad použití operace Disjoint sharp\relax }{figure.2.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2.3}Form\IeC {\'a}t PLA}{7}{section.2.3}}
\newlabel{sec:formatpla}{{2.3}{7}{Formát PLA\relax }{section.2.3}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2.4}N\IeC {\'a}stroj BOOM}{7}{section.2.4}}
\newlabel{sec:boom}{{2.4}{7}{Nástroj BOOM\relax }{section.2.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces P\IeC {\v r}\IeC {\'\i }klad v\IeC {\'y}pisu souboru s logickou funkc\IeC {\'\i } v PLA form\IeC {\'a}tu.}}{8}{figure.2.3}}
\newlabel{fig:plaformat}{{2.3}{8}{Příklad výpisu souboru s logickou funkcí v PLA formátu}{figure.2.3}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {3}Popis probl\IeC {\'e}mu ortogonalizace}{9}{chapter.3}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {3.1}Ortogonalizace}{9}{section.3.1}}
\@writefile{toc}{\contentsline {section}{\numberline {3.2}Ortogonalizace logick\IeC {\'e} funkce}{9}{section.3.2}}
\newlabel{sec:ortogonalizace_definice}{{3.2}{9}{Ortogonalizace logické funkce\relax }{section.3.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.1}{\ignorespaces Logick\IeC {\'a} funkce a jej\IeC {\'\i } ortogonalizovan\IeC {\'y} tvar zapsan\IeC {\'y} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{10}{figure.3.1}}
\newlabel{fig:mapa0}{{3.1}{10}{Logická funkce a její ortogonalizovaný tvar zapsaný v Karnaughové mapě}{figure.3.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3.3}Rozlo\IeC {\v z}en\IeC {\'\i } dvou term\IeC {\r u}}{10}{section.3.3}}
\@writefile{toc}{\contentsline {section}{\numberline {3.4}\IeC {\v C}asov\IeC {\'a} slo\IeC {\v z}itost algoritmu}{10}{section.3.4}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.2}{\ignorespaces Logick\IeC {\'a} funkce zapsan\IeC {\'a} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{11}{figure.3.2}}
\newlabel{fig:mapa1}{{3.2}{11}{Logická funkce zapsaná v Karnaughové mapě}{figure.3.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.3}{\ignorespaces Ortogonalizovan\IeC {\'a} logick\IeC {\'a} funkce. Uk\IeC {\'a}zka dvou zp\IeC {\r u}sob\IeC {\r u} rozkladu.}}{11}{figure.3.3}}
\newlabel{fig:mapa2}{{3.3}{11}{Ortogonalizovaná logická funkce. Ukázka dvou způsobů rozkladu}{figure.3.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4.1}Optim\IeC {\'a}ln\IeC {\'\i } \IeC {\v r}e\IeC {\v s}en\IeC {\'\i }}{11}{subsection.3.4.1}}
\@writefile{toc}{\contentsline {chapter}{\numberline {4}Sezn\IeC {\'a}men\IeC {\'\i } s existuj\IeC {\'\i }c\IeC {\'\i }mi implementacemi}{13}{chapter.4}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {4.1}Espresso}{13}{section.4.1}}
\newlabel{sec:Espresso_Disjoint}{{4.1}{13}{Espresso\relax }{section.4.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4.2}DSOP}{13}{section.4.2}}
\newlabel{sec:DSOP_1}{{4.2}{13}{DSOP\relax }{section.4.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4.3}DSOP vyu\IeC {\v z}\IeC {\'\i }vaj\IeC {\'\i }c\IeC {\'\i } maxim\IeC {\'a}ln\IeC {\'\i } binate prom\IeC {\v e}nn\IeC {\'e}}{14}{section.4.3}}
\@writefile{toc}{\contentsline {chapter}{\numberline {5}Anal\IeC {\'y}za probl\IeC {\'e}mu a n\IeC {\'a}vrh implementace}{17}{chapter.5}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {5.1}Rozklad term\IeC {\r u}}{17}{section.5.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1.1}Postupn\IeC {\'y} rozklad}{17}{subsection.5.1.1}}
\@writefile{toc}{\contentsline {section}{\numberline {5.2}\IeC {\v R}\IeC {\'\i }zen\IeC {\'\i } rozkladu}{17}{section.5.2}}
\newlabel{sec:rizeni_rozkladu}{{5.2}{17}{Řízení rozkladu\relax }{section.5.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2.1}Se\IeC {\v r}azen\IeC {\'\i } podle velikosti term\IeC {\r u}}{18}{subsection.5.2.1}}
\newlabel{sec:sort1}{{5.2.1}{18}{Seřazení podle velikosti termů\relax }{subsection.5.2.1}{}}
\@writefile{toc}{\contentsline {paragraph}{P\IeC {\v r}\IeC {\'\i }klad 5.1}{18}{section*.5}}
\@writefile{toc}{\contentsline {paragraph}{P\IeC {\v r}\IeC {\'\i }klad 5.2}{18}{section*.6}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.1}{\ignorespaces Logick\IeC {\'a} funkce $F_{1}$ zapsan\IeC {\'a} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{18}{figure.5.1}}
\newlabel{fig:exam_termsizesort_dec_1}{{5.1}{18}{Logická funkce $F_{1}$ zapsaná v Karnaughové mapě}{figure.5.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.2}{\ignorespaces Rozklad $F_{1}$ s pou\IeC {\v z}it\IeC {\'\i }m metod \IeC {\v r}azen\IeC {\'\i } podle velikosti term\IeC {\r u} sestupn\IeC {\v e} a vzestupn\IeC {\v e}. }}{19}{figure.5.2}}
\newlabel{fig:exam_termsizesort_dec_2}{{5.2}{19}{Rozklad $F_{1}$ s použitím metod řazení podle velikosti termů sestupně a vzestupně. \relax }{figure.5.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.3}{\ignorespaces Logick\IeC {\'a} funkce $F_{2}$ zapsan\IeC {\'a} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{19}{figure.5.3}}
\newlabel{fig:exam_termsizesort_inc_1}{{5.3}{19}{Logická funkce $F_{2}$ zapsaná v Karnaughové mapě}{figure.5.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2.2}Se\IeC {\v r}azen\IeC {\'\i } term\IeC {\r u} podle po\IeC {\v c}tu protnut\IeC {\'\i } s ostatn\IeC {\'\i }mi termy}{19}{subsection.5.2.2}}
\newlabel{sec:sort2}{{5.2.2}{19}{Seřazení termů podle počtu protnutí s ostatními termy\relax }{subsection.5.2.2}{}}
\@writefile{toc}{\contentsline {paragraph}{P\IeC {\v r}\IeC {\'\i }klad 5.3}{19}{section*.7}}
\@writefile{toc}{\contentsline {paragraph}{P\IeC {\v r}\IeC {\'\i }klad 5.4}{19}{section*.8}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.4}{\ignorespaces Rozklad $F_{2}$ s pou\IeC {\v z}it\IeC {\'\i }m metod \IeC {\v r}azen\IeC {\'\i } podle velikosti term\IeC {\r u} sestupn\IeC {\v e} a vzestupn\IeC {\v e}. }}{20}{figure.5.4}}
\newlabel{fig:exam_termsizesort_inc_2}{{5.4}{20}{Rozklad $F_{2}$ s použitím metod řazení podle velikosti termů sestupně a vzestupně. \relax }{figure.5.4}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.5}{\ignorespaces Logick\IeC {\'a} funkce $F_{3}$ zapsan\IeC {\'a} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{20}{figure.5.5}}
\newlabel{fig:exam_termintsort_dec_1}{{5.5}{20}{Logická funkce $F_{3}$ zapsaná v Karnaughové mapě}{figure.5.5}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2.3}S\IeC {\'e}riov\IeC {\'e} pou\IeC {\v z}it\IeC {\'\i } v\IeC {\'\i }ce t\IeC {\v r}\IeC {\'\i }d\IeC {\'\i }c\IeC {\'\i }ch metod}{20}{subsection.5.2.3}}
\newlabel{sec:sort_seriove}{{5.2.3}{20}{Sériové použití více třídících metod\relax }{subsection.5.2.3}{}}
\@writefile{toc}{\contentsline {paragraph}{P\IeC {\v r}\IeC {\'\i }klad 5.5}{20}{section*.9}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.6}{\ignorespaces Rozklad $F_{3}$ s pou\IeC {\v z}it\IeC {\'\i }m metod \IeC {\v r}azen\IeC {\'\i } podle velikosti term\IeC {\r u} sestupn\IeC {\v e} a vzestupn\IeC {\v e}. }}{21}{figure.5.6}}
\newlabel{fig:exam_termintsort_dec_2}{{5.6}{21}{Rozklad $F_{3}$ s použitím metod řazení podle velikosti termů sestupně a vzestupně. \relax }{figure.5.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.7}{\ignorespaces Logick\IeC {\'a} funkce $F_{4}$ zapsan\IeC {\'a} v Karnaughov\IeC {\'e} map\IeC {\v e}.}}{21}{figure.5.7}}
\newlabel{fig:exam_termintsort_inc_1}{{5.7}{21}{Logická funkce $F_{4}$ zapsaná v Karnaughové mapě}{figure.5.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5.3}Slo\IeC {\v z}en\IeC {\'\i } term\IeC {\r u}}{21}{section.5.3}}
\newlabel{sec:slozeni_termu}{{5.3}{21}{Složení termů\relax }{section.5.3}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3.1}Pohlcen\IeC {\'\i } term\IeC {\r u}}{21}{subsection.5.3.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3.2}Slou\IeC {\v c}en\IeC {\'\i } term\IeC {\r u}}{21}{subsection.5.3.2}}
\newlabel{sec:slouceni_termu}{{5.3.2}{21}{Sloučení termů\relax }{subsection.5.3.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.8}{\ignorespaces Rozklad $F_{4}$ s pou\IeC {\v z}it\IeC {\'\i }m metod \IeC {\v r}azen\IeC {\'\i } podle po\IeC {\v c}tu protnut\IeC {\'\i } s ostatn\IeC {\'\i }mi termy sestupn\IeC {\v e} a vzestupn\IeC {\v e}. }}{22}{figure.5.8}}
\newlabel{fig:exam_termintsort_inc_2}{{5.8}{22}{Rozklad $F_{4}$ s použitím metod řazení podle počtu protnutí s ostatními termy sestupně a vzestupně. \relax }{figure.5.8}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.9}{\ignorespaces Logick\IeC {\'a} funkce $f_{5}$ zadan\IeC {\'a} pravdivostn\IeC {\'\i } tabulkou a Karnaughovou mapou.}}{22}{figure.5.9}}
\newlabel{fig:seriove_razeni_zadani}{{5.9}{22}{Logická funkce $f_{5}$ zadaná pravdivostní tabulkou a Karnaughovou mapou}{figure.5.9}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.10}{\ignorespaces S\IeC {\'e}riov\IeC {\'e} pou\IeC {\v z}it\IeC {\'\i } dvou t\IeC {\v r}\IeC {\'\i }d\IeC {\'\i }c\IeC {\'\i }ch metod b\IeC {\v e}hem prvn\IeC {\'\i }ho kroku rozkladu.}}{23}{figure.5.10}}
\newlabel{fig:seriove_razeni}{{5.10}{23}{Sériové použití dvou třídících metod během prvního kroku rozkladu}{figure.5.10}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3.3}Se\IeC {\v r}azen\IeC {\'\i } term\IeC {\r u} podle po\IeC {\v c}tu mo\IeC {\v z}nost\IeC {\'\i } slou\IeC {\v c}en\IeC {\'\i }}{23}{subsection.5.3.3}}
\newlabel{sec:sort_by_merge}{{5.3.3}{23}{Seřazení termů podle počtu možností sloučení\relax }{subsection.5.3.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.11}{\ignorespaces Rozklad logick\IeC {\'e} funkce $f_{5}$ s pou\IeC {\v z}it\IeC {\'\i }m sestupn\IeC {\'e}ho se\IeC {\v r}azen\IeC {\'\i } podle po\IeC {\v c}tu protnut\IeC {\'\i } s ostatn\IeC {\'\i }mi termy - lev\IeC {\'a} Karnaughov\IeC {\'a} mapa, s pou\IeC {\v z}\IeC {\'\i }t\IeC {\'\i }m dvou s\IeC {\'e}riov\IeC {\'y}ch \IeC {\v r}ad\IeC {\'\i }c\IeC {\'\i }ch metod za sebou - prav\IeC {\'a} Karnaughov\IeC {\'a} mapa.}}{24}{figure.5.11}}
\newlabel{fig:seriove_razeni_pr1}{{5.11}{24}{Rozklad logické funkce $f_{5}$ s použitím sestupného seřazení podle počtu protnutí s ostatními termy - levá Karnaughová mapa, s použítím dvou sériových řadících metod za sebou - pravá Karnaughová mapa}{figure.5.11}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.12}{\ignorespaces Pohlcen\IeC {\'\i } nadbyte\IeC {\v c}n\IeC {\'y}ch term\IeC {\r u}. }}{24}{figure.5.12}}
\newlabel{fig:mergeterm1}{{5.12}{24}{Pohlcení nadbytečných termů. \relax }{figure.5.12}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5.4}P\IeC {\v r}edzpracov\IeC {\'a}n\IeC {\'\i } vstupn\IeC {\'\i }ho seznamu term\IeC {\r u}}{24}{section.5.4}}
\newlabel{sec:nastaveni_vystupu_uvod}{{5.4}{24}{Předzpracování vstupního seznamu termů\relax }{section.5.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.1}Nastaven\IeC {\'\i } v\IeC {\'y}stup\IeC {\r u} term\IeC {\r u}}{24}{subsection.5.4.1}}
\newlabel{sec:nastaveni_vystupu}{{5.4.1}{24}{Nastavení výstupů termů\relax }{subsection.5.4.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.13}{\ignorespaces Logick\IeC {\'a} funkce, jej\IeC {\'\i } ortogonalizovan\IeC {\'a} podoba a jej\IeC {\'\i } tvar po slou\IeC {\v c}en\IeC {\'\i } dvou term\IeC {\r u}. }}{25}{figure.5.13}}
\newlabel{fig:mergeterm2}{{5.13}{25}{Logická funkce, její ortogonalizovaná podoba a její tvar po sloučení dvou termů. \relax }{figure.5.13}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.14}{\ignorespaces Logick\IeC {\'a} funkce a jeji ortogonalizovan\IeC {\'a} podoba bez pou\IeC {\v z}it\IeC {\'\i } se\IeC {\v r}azen\IeC {\'\i } term\IeC {\r u} podle po\IeC {\v c}tu mo\IeC {\v z}nost\IeC {\'\i } slou\IeC {\v c}en\IeC {\'\i }.}}{25}{figure.5.14}}
\newlabel{fig:mergesort1}{{5.14}{25}{Logická funkce a jeji ortogonalizovaná podoba bez použití seřazení termů podle počtu možností sloučení}{figure.5.14}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.4.2}Minimalizace term\IeC {\r u}}{25}{subsection.5.4.2}}
\newlabel{sec:predzpracovani_espresso}{{5.4.2}{25}{Minimalizace termů\relax }{subsection.5.4.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.15}{\ignorespaces Logick\IeC {\'a} funkce, jeji ortogonalizovan\IeC {\'a} podoba a podoba s pou\IeC {\v z}it\IeC {\'\i }m ortogonalizace s \IeC {\v r}azen\IeC {\'\i }m term\IeC {\r u} podle po\IeC {\v c}tu mo\IeC {\v z}nost\IeC {\'\i } slou\IeC {\v c}en\IeC {\'\i }.}}{26}{figure.5.15}}
\newlabel{fig:mergesort2}{{5.15}{26}{Logická funkce, jeji ortogonalizovaná podoba a podoba s použitím ortogonalizace s řazením termů podle počtu možností sloučení}{figure.5.15}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5.5}N\IeC {\'a}vrh algoritmu}{26}{section.5.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5.1}Sch\IeC {\'e}ma algoritmu}{26}{subsection.5.5.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5.2}Popis f\IeC {\'a}z\IeC {\'\i } algoritmu}{26}{subsection.5.5.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {5.16}{\ignorespaces Sch\IeC {\'e}ma z\IeC {\'a}kladn\IeC {\'\i } koncepce algoritmu ortogonalizace logick\IeC {\'e} funkce}}{27}{figure.5.16}}
\newlabel{fig:algorithm1}{{5.16}{27}{Schéma základní koncepce algoritmu ortogonalizace logické funkce\relax }{figure.5.16}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {6}Realizace \IeC {\v r}e\IeC {\v s}en\IeC {\'\i }}{29}{chapter.6}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {6.1}Programov\IeC {\'e} vybaven\IeC {\'\i } pro implementaci algoritmu}{29}{section.6.1}}
\@writefile{toc}{\contentsline {section}{\numberline {6.2}Pseudok\IeC {\'o}d zjednodu\IeC {\v s}en\IeC {\'e}ho algoritmu}{29}{section.6.2}}
\@writefile{toc}{\contentsline {section}{\numberline {6.3}Proces dekompozice term\IeC {\r u}}{30}{section.6.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.3.1}Funkce TermDisjointSharp}{30}{subsection.6.3.1}}
\@writefile{toc}{\contentsline {section}{\numberline {6.4}Set\IeC {\v r}\IeC {\'\i }zen\IeC {\'\i } term\IeC {\r u}}{30}{section.6.4}}
\@writefile{lof}{\contentsline {figure}{\numberline {6.1}{\ignorespaces V\IeC {\'y}pis zdrojov\IeC {\'e}ho k\IeC {\'o}du operace $\bigodot $ mezi termy $t_{1}$ a $t_{2}$ (2. \IeC {\v c}\IeC {\'a}st funkce TermDisjointSharp)}}{31}{figure.6.1}}
\newlabel{fig:source1}{{6.1}{31}{Výpis zdrojového kódu operace $\bigodot $ mezi termy $t_{1}$ a $t_{2}$ (2. část funkce TermDisjointSharp)\relax }{figure.6.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6.5}Slou\IeC {\v c}en\IeC {\'\i } term\IeC {\r u} a absorbce}{32}{section.6.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {6.5.1}Funkce BackMerge}{32}{subsection.6.5.1}}
\newlabel{sec:backmerge}{{6.5.1}{32}{Funkce BackMerge\relax }{subsection.6.5.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6.6}Eliminace term\IeC {\r u} nepat\IeC {\v r}\IeC {\'\i }c\IeC {\'\i } do ONsetu}{32}{section.6.6}}
\newlabel{sec:realizace_nastaveni_hodnot}{{6.6}{32}{Eliminace termů nepatřící do ONsetu\relax }{section.6.6}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6.7}Minimalizace vstupn\IeC {\'\i }ch term\IeC {\r u} pomoc\IeC {\'\i } Espressa}{32}{section.6.7}}
\newlabel{sec:predzpracovani_espresso}{{6.7}{32}{Minimalizace vstupních termů pomocí Espressa\relax }{section.6.7}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {7}Testov\IeC {\'a}n\IeC {\'\i }}{33}{chapter.7}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:testovani}{{7}{33}{Testování\relax }{chapter.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {7.1}Ozna\IeC {\v c}en\IeC {\'\i } testovan\IeC {\'y}ch algoritm\IeC {\r u}}{33}{section.7.1}}
\@writefile{toc}{\contentsline {section}{\numberline {7.2}Postup testov\IeC {\'a}n\IeC {\'\i }}{34}{section.7.2}}
\@writefile{toc}{\contentsline {section}{\numberline {7.3}Test funk\IeC {\v c}nosti}{34}{section.7.3}}
\@writefile{toc}{\contentsline {section}{\numberline {7.4}Srovn\IeC {\'a}vac\IeC {\'\i } testy}{35}{section.7.4}}
\newlabel{sec:srovnavaci_test}{{7.4}{35}{Srovnávací testy\relax }{section.7.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {7.5}Porovn\IeC {\'a}n\IeC {\'\i } pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'e}ho uspo\IeC {\v r}\IeC {\'a}dan\IeC {\'\i } term\IeC {\r u}}{35}{section.7.5}}
\newlabel{sec:test_razeni}{{7.5}{35}{Porovnání průběžného uspořádaní termů\relax }{section.7.5}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.1}Porovn\IeC {\'a}n\IeC {\'\i } v\IeC {\'y}sledk\IeC {\r u} metod \IeC {\v r}azen\IeC {\'\i }}{35}{subsection.7.5.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.2}Porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}asu metod \IeC {\v r}azen\IeC {\'\i }}{36}{subsection.7.5.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.3}Srovn\IeC {\'a}n\IeC {\'\i } algoritmu \textit  {WithoutSort} s algoritmy s pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'y}m \IeC {\v r}azen\IeC {\'\i }m}{36}{subsection.7.5.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.4}Srovn\IeC {\'a}n\IeC {\'\i } \IeC {\v r}azen\IeC {\'\i } \textit  {SizeSortInc} a \textit  {SizeSortDec}}{37}{subsection.7.5.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.5}Srovn\IeC {\'a}n\IeC {\'\i } \IeC {\v r}azen\IeC {\'\i } \textit  {IntersectionSortInc} a \textit  {IntersectionSortDec} }{37}{subsection.7.5.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.6}Srovn\IeC {\'a}n\IeC {\'\i } \IeC {\v r}azen\IeC {\'\i } \textit  {SizeSortDec} se s\IeC {\'e}riov\IeC {\'y}m \IeC {\v r}azen\IeC {\'\i }m \textit  {SizeIntersectionSortInc} a \textit  {SizeIntersectionSortDec}}{37}{subsection.7.5.6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.7}Srovn\IeC {\'a}n\IeC {\'\i } \IeC {\v r}azen\IeC {\'\i } \textit  {SortByMergeInc} a \textit  {SortByMergeDec} s metodou \textit  {WithoutSort} }{37}{subsection.7.5.7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.5.8}Zhodnocen\IeC {\'\i } testov\IeC {\'a}n\IeC {\'\i } \IeC {\v r}ad\IeC {\'\i }c\IeC {\'\i }ch metod algoritmu}{37}{subsection.7.5.8}}
\@writefile{toc}{\contentsline {section}{\numberline {7.6}Porovn\IeC {\'a}n\IeC {\'\i } algoritmu s ciz\IeC {\'\i }mi implementacemi}{38}{section.7.6}}
\newlabel{sec:test_razeni}{{7.6}{38}{Porovnání algoritmu s cizími implementacemi\relax }{section.7.6}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.6.1}Porovn\IeC {\'a}n\IeC {\'\i } v\IeC {\'y}sledk\IeC {\r u} algoritm\IeC {\r u}}{38}{subsection.7.6.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.6.2}Porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}as\IeC {\r u} algoritm\IeC {\r u}}{38}{subsection.7.6.2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.6.3}Srovn\IeC {\'a}n\IeC {\'\i } algoritm\IeC {\r u} \textit  {SizeSortDec}, \textit  {A\_BackMerge}, \textit  {A\_EliminateUnde-fined} a \textit  {A\_Espresso} }{39}{subsection.7.6.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.6.4}Srovn\IeC {\'a}n\IeC {\'\i } algoritmu \textit  {Espresso -Ddisjoint} s ostatn\IeC {\'\i }mi implementacemi}{39}{subsection.7.6.4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.6.5}Srovn\IeC {\'a}n\IeC {\'\i } algoritm\IeC {\r u} \textit  {A\_EliminateUndefined} , \textit  {A\_Espresso} a \textit  {DSOP}}{39}{subsection.7.6.5}}
\newlabel{ref:srovnani_s_DSOP}{{7.6.5}{39}{Srovnání algoritmů \textit {A\_EliminateUndefined} , \textit {A\_Espresso} a \textit {DSOP}\relax }{subsection.7.6.5}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {8}Z\IeC {\'a}v\IeC {\v e}r}{41}{chapter.8}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {9}Literatura a pou\IeC {\v z}it\IeC {\'e} zdroje}{43}{chapter.9}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {A}Porovn\IeC {\'a}n\IeC {\'\i } metod pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'e}ho \IeC {\v r}azen\IeC {\'\i } term\IeC {\r u}}{45}{appendix.A}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:test_one}{{A}{45}{Porovnání metod průběžného řazení termů\relax }{appendix.A}{}}
\gdef \LT@i {\LT@entry 
    {1}{26.22636pt}\LT@entry 
    {1}{68.9055pt}\LT@entry 
    {1}{33.90874pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {1}{40.15817pt}\LT@entry 
    {6}{39.21971pt}\LT@entry 
    {6}{39.21971pt}}
\@writefile{lot}{\contentsline {table}{\numberline {A.1}{Srovn\IeC {\'a}vac\IeC {\'\i } test - porovn\IeC {\'a}n\IeC {\'\i } metod pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'e}ho uspo\IeC {\v r}\IeC {\'a}d\IeC {\'a}n\IeC {\'\i } term\IeC {\r u}}}{48}{table.A.1}}
\newlabel{tab:tab11}{{A.1}{48}{Porovnání metod průběžného řazení termů\relax }{table.A.1}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {B}Porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}as\IeC {\r u} metod pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'e}ho \IeC {\v r}azen\IeC {\'\i } term\IeC {\r u}}{49}{appendix.B}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:test_two}{{B}{49}{Porovnání časů metod průběžného řazení termů\relax }{appendix.B}{}}
\gdef \LT@ii {\LT@entry 
    {1}{26.22636pt}\LT@entry 
    {1}{68.9055pt}\LT@entry 
    {1}{31.86641pt}\LT@entry 
    {6}{33.77577pt}\LT@entry 
    {1}{35.48517pt}\LT@entry 
    {2}{33.77577pt}\LT@entry 
    {6}{33.77577pt}\LT@entry 
    {1}{35.24538pt}\LT@entry 
    {1}{40.15817pt}\LT@entry 
    {6}{33.77577pt}\LT@entry 
    {3}{33.77577pt}}
\@writefile{lot}{\contentsline {table}{\numberline {B.1}{Srovn\IeC {\'a}vac\IeC {\'\i } test - Porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}as\IeC {\r u} metod pr\IeC {\r u}b\IeC {\v e}\IeC {\v z}n\IeC {\'e}ho uspo\IeC {\v r}\IeC {\'a}d\IeC {\'a}n\IeC {\'\i } term\IeC {\r u}}}{52}{table.B.1}}
\newlabel{tab:tab12}{{B.1}{52}{Porovnání časů metod průběžného řazení termů\relax }{table.B.1}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {C}Porovn\IeC {\'a}n\IeC {\'\i } navr\IeC {\v z}en\IeC {\'e}ho algoritmu s ciz\IeC {\'\i }mi implementacemi}{53}{appendix.C}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:test_three}{{C}{53}{Porovnání navrženého algoritmu s cizími implementacemi\relax }{appendix.C}{}}
\gdef \LT@iii {\LT@entry 
    {1}{26.22636pt}\LT@entry 
    {1}{68.9055pt}\LT@entry 
    {5}{39.21971pt}\LT@entry 
    {5}{39.21971pt}\LT@entry 
    {1}{42.19484pt}\LT@entry 
    {1}{39.26187pt}\LT@entry 
    {5}{39.21971pt}\LT@entry 
    {1}{46.47388pt}\LT@entry 
    {1}{117.36821pt}\LT@entry 
    {1}{0.0pt}}
\@writefile{lot}{\contentsline {table}{\numberline {C.1}{Srovn\IeC {\'a}vac\IeC {\'\i } test - porovn\IeC {\'a}n\IeC {\'\i } vybran\IeC {\'y}ch metod navr\IeC {\v z}en\IeC {\'e}ho algoritmu s ciz\IeC {\'\i }mi dostupn\IeC {\'y}mi implementacemi}}{55}{table.C.1}}
\newlabel{tab:tab13}{{C.1}{55}{Porovnání navrženého algoritmu s cizími implementacemi\relax }{table.C.1}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {D}Porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}as\IeC {\r u} navr\IeC {\v z}en\IeC {\'e}ho algoritmu s ciz\IeC {\'\i }mi implementacemi}{57}{appendix.D}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:test_four}{{D}{57}{Porovnání časů navrženého algoritmu s cizími implementacemi\relax }{appendix.D}{}}
\gdef \LT@iv {\LT@entry 
    {1}{26.22636pt}\LT@entry 
    {1}{68.9055pt}\LT@entry 
    {5}{36.80186pt}\LT@entry 
    {1}{42.19484pt}\LT@entry 
    {1}{39.26187pt}\LT@entry 
    {5}{36.80186pt}\LT@entry 
    {1}{46.47388pt}\LT@entry 
    {1}{117.36821pt}\LT@entry 
    {1}{0.0pt}}
\@writefile{lot}{\contentsline {table}{\numberline {D.1}{Srovn\IeC {\'a}vac\IeC {\'\i } test - porovn\IeC {\'a}n\IeC {\'\i } \IeC {\v c}as\IeC {\r u} vybran\IeC {\'y}ch metod navr\IeC {\v z}en\IeC {\'e}ho algoritmu s ciz\IeC {\'\i }mi dostupn\IeC {\'y}mi implementacemi}}{59}{table.D.1}}
\newlabel{tab:tab14}{{D.1}{59}{Porovnání časů navrženého algoritmu s cizími implementacemi\relax }{table.D.1}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {E}Ovl\IeC {\'a}d\IeC {\'a}n\IeC {\'\i } navr\IeC {\v z}en\IeC {\'e}ho programu}{61}{appendix.E}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:ovladani_programu}{{E}{61}{Ovládání navrženého programu\relax }{appendix.E}{}}
\@writefile{toc}{\contentsline {chapter}{\numberline {F}Obsah p\IeC {\v r}ilo\IeC {\v z}en\IeC {\'e}ho CD}{63}{appendix.F}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{sec:priloha_CD}{{F}{63}{Obsah přiloženého CD\relax }{appendix.F}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {F.1}{\ignorespaces Obsah p\IeC {\v r}ilo\IeC {\v z}en\IeC {\'e}ho CD}}{63}{figure.F.1}}
\newlabel{fig:obsahcd}{{F.1}{63}{Obsah přiloženého CD\relax }{figure.F.1}{}}
