mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 19:47:32 +01:00
Krzysztof kuhy Rudnicki
ffa5dad02a
The 250-line cap applies to prose too, and the reports were the worst
offenders -- ENUME's projectA.tex alone was 1,876 lines. Each is now a
preamble plus one \input{} per section, which is how a long LaTeX document is
normally organised; not one byte of prose was rewritten.
"The PDF is unchanged" is checked by a script rather than by eye, because
hashing the PDF cannot work: pdflatex stamps a /CreationDate and an /ID into
every build, so two runs of the SAME source already differ. tex_fingerprint.sh
compares what a reader sees instead -- page count plus a hash of the extracted
text -- and it is stable across rebuilds of untouched sources, which is the
property that makes it usable as a gate.
It earned its keep immediately. Both ECOTE reports quote an example LaTeX
document inside an lstlisting block, so \end{document} appears in the middle
of the file; splitting on the FIRST one stranded everything after it. Same
page count, different text, caught automatically. EOPSY lab3 exposed a second
bug: a \section{} title that runs onto the next line.
Result: 19 .tex over the cap -> 1. The survivor,
ELAC/.../03-building-nfa-...tex, is 418 lines of consecutive tikz figures
with no subsection to split on and needs a hand-placed boundary.
Verified: 29 splits across two passes (section, then subsection for the
pieces still over), every one reporting `unchanged` from
scripts/tex_fingerprint.sh --check.
Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
84 lines
2.7 KiB
TeX
84 lines
2.7 KiB
TeX
\section{Constructing minimal state DFA}
|
|
|
|
\begin{tabular}{|*{7}{c|}}
|
|
\cline{1-1}
|
|
$\underline{A}$ \\ \cline{1-2}
|
|
$\underline{B}$ & $x_1$ \\ \cline{1-3}
|
|
C & $x_1$ & $x_1$ \\ \cline{1-4}
|
|
D & $x_1$ & $x_1$ & $x_2$ \\ \cline{1-5}
|
|
$\underline{E}$ & $x_1$ & $x_1$ & $x_1$ & $x_1$ \\ \cline{1-6}
|
|
$\emptyset$ & $x_1$ & $x_1$ & $x_2$ & $x_2$ & $x_1$ \\ \hline
|
|
& $\underline{A}$ & $\underline{B}$ & C & D & $\underline{E}$ & $\emptyset$ \\ \hline
|
|
\end{tabular}
|
|
|
|
\begin{enumerate}
|
|
\item First I marked (with $x_1$) all the pairs in which at least one of them were final state:
|
|
\[ ([\underline{A}, \emptyset], [\underline{A}, \underline{E}], [\underline{A}, D], [\underline{A}, C], [\underline{A}, \underline{B}]) \]
|
|
\[ ([\underline{B}, \emptyset], ([\underline{B}, \underline{E}], ([\underline{B}, D], ([\underline{B}, C]) \]
|
|
\[ ([\underline{E}, \emptyset], [\underline{E}, C], [\underline{E}, D])\]
|
|
|
|
\item We are left with the pairs:
|
|
\[ ([\emptyset , C], [\emptyset , D], [D , C] ) \]
|
|
For pair: $ [\emptyset , C] $ C goes to final state $\underline{E}$ on transition 'b' therefore we mark it with $x_2$
|
|
For pair: $ [\emptyset , D] $ D goes to final state $\underline{E}$ on transition 'b' therefore we mark it with $x_2$
|
|
For pair: $ [D , C] $ both C and D go to final state $\underline{E}$ on transition 'b' therefore we mark it with $x_2$
|
|
\end{enumerate}
|
|
|
|
No states could be minimized! Therefore our final minimal state DFA looks like this:
|
|
|
|
\begin{figure}[!htb]
|
|
\centering
|
|
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
|
|
|
|
\node (q0) [state, accepting, initial, initial text = {}] {A};
|
|
\node (q1) [state, accepting, above right = of q0] {B};
|
|
\node (q2) [state, below right = of q0] {C};
|
|
\node (q3) [state, accepting, above right = of q2] {E};
|
|
\node (q4) [state, below right = of q2] {D};
|
|
\node (q5) [state, right = of q1] {$\emptyset$};
|
|
|
|
\path [-stealth, thick]
|
|
(q0) edge node {$a$} (q1);
|
|
|
|
\path [-stealth, thick]
|
|
(q0) edge node {$b$} (q2);
|
|
|
|
\path [-stealth, thick]
|
|
(q1) edge [loop] node {$a$} (q1);
|
|
|
|
\path [-stealth, thick]
|
|
(q2) edge node {$a$} (q4);
|
|
|
|
\path [-stealth, thick]
|
|
(q2) edge node {$b$} (q3);
|
|
|
|
\path [-stealth, thick]
|
|
(q4) edge node {$b$} (q3);
|
|
|
|
\path [-stealth, thick]
|
|
(q1) edge [bend left] node {$a, b$} (q5);
|
|
|
|
\path [-stealth, thick]
|
|
(q3) edge [below loop] node {$a$} (q3);
|
|
|
|
\path [-stealth, thick]
|
|
(q3) edge node {$a$} (q5);
|
|
|
|
\path [-stealth, thick]
|
|
(q4) edge [bend right] node {$a$} (q5);
|
|
|
|
\path [-stealth, thick]
|
|
(q5) edge [loop] node {$a, b$} (q5);
|
|
|
|
|
|
|
|
|
|
|
|
\end{tikzpicture}
|
|
\caption{DFA graph after minimalization} \label{dfaMinimalization}
|
|
\end{figure}
|
|
|
|
|
|
|
|
|