Final preparations (or afterwards?).
[algebraic-prog-equiv.git] / free-plain-det.tex
blob1d1062ccaf99c0c3675dac1ef94fdbe1320c1179
1 \subsection{ïÐÒÅÄÅÌÅÎÉÑ}
4 \subsubsection{CÉÓÔÅÍÙ ÐÅÒÅÈÏÄÏ× É ÄÅÔÅÒÍÉÎÉÒÏ×ÁÎÎÙÅ Á×ÔÏÍÁÔÙ}
6 óÉÓÔÅÍÁ ÐÅÒÅÈÏÄÏ×
8 îÏÒÍÁÌÉÚÏ×
10 \subsection{íÁÔÒÉÃÙ}
11 ÎÅÚÁ×ÉÓ
15 ---
17 ÞÅÒÅÚ ËÒÁÔÎÏÓÔÉ
19 ---
21 ÎÁ Ó×. ÍÏÄÅÌÉ
23 ÎÁ ÏÔÄÅÌØÎÙÈ ÍÏÄÅÌÑÈ-<<ÓÌÏ×ÁÈ>>
25 \begin{question}
26 ëÁË Ó×ÑÚÁÎÙ ÁÌÇÏÒÉÔÍÙ ÐÒÏ×ÅÒËÉ $\au A = \au B$ ÄÌÑ ÄÅÔÅÒÍ./ÏÄÎÏÚÎ. É
27 $\au A = 0$ ÄÌÑ ËÒÁÔÎ.? ëÏÇÄÁ ÍÏÖÎÏ ÒÅÛÉÔØ ÐÒÏÂÌÅÍÕ $\au A = 0$ Ó
28 ËÒÁÔÎ. ÎÁ ÏÓÎÏ×Å ÁÌÇÏÒÉÔÍÁ ÄÌÑ $\au A = \au B$?
29 \end{question}
31 \begin{definition}
32 ðÕÓÔØ $s \in \AExp_\Sigma.$
33 $\detA(s)$ ÏÂÏÚÎÁÞÁÅÔ ÒÅÚÕÌØÔÁÔ \tING{ÄÅÔÅÒÍÉÎÉÚÁÃÉÉ} Á×ÔÏÍÁÔÁ
34 ÓÔÁÎÄÁÒÔÎÙÍ ÐÏÓÔÒÏÅÎÉÅÍ,
35 ÏÓÎÏ×ÁÎÎÏÍ ÎÁ ÐÏÄÍÎÏÖÅÓÔ×ÁÈ ÍÎÏÖÅÓÔ×Á ÓÏÓÔÏÑÎÉÊ ÉÓÈÏÄÎÏÇÏ Á×ÔÏÍÁÔÁ
36 \cite{HopcroftUllman-automata,LewisPapadimitriou-computation}.
37 \end{definition}
38 \begin{lemma}\label{lem:detA}
39 \cite[Lemma~17]{KA-regevents-complete}, \cite[Lectures~8--9]{KA-lect02}.
41 \KA \models s = \detA(s)
43 \end{lemma}
45 \begin{definition}
46 ðÕÓÔØ $s \in \AExp_\Sigma.$
47 $\minA(s)$ ÏÂÏÚÎÁÞÁÅÔ ÒÅÚÕÌØÔÁÔ \tING{ÍÉÎÉÍÉÚÁÃÉÉ} Á×ÔÏÍÁÔÁ
48 ÓÔÁÎÄÁÒÔÎÙÍ ÐÏÓÔÒÏÅÎÉÅÍ
49 \cite{HopcroftUllman-automata,LewisPapadimitriou-computation}.
50 \end{definition}
51 \begin{lemma}\label{lem:minA}
52 \cite[Lemma~18]{KA-regevents-complete}, \cite[Lectures~8--9]{KA-lect02}.
54 \KA \models s = \minA(s)
56 \end{lemma}
58 \begin{theorem}\label{th:minA-unique}
59 \cite{HopcroftUllman-automata}
60 åÓÌÉ $R_\Sigma(s) = R_\Sigma(t)$, ÔÏ $\minA(s)$ É $\minA(t)$ ÉÚÏÍÏÒÆÎÙ.
61 \end{theorem}
62 %%% Local Variables:
63 %%% mode: latex
64 %%% TeX-master: "main"
65 %%% End: