kuhyx/WUT_Computer_Science
1
0
Fork 0
mirror of https://github.com/kuhyx/WUT_Computer_Science.git synced 2026-07-04 20:03:04 +02:00
Code Issues Actions Packages Projects Releases Wiki Activity
main
WUT_Computer_Science/NotProgramming/ELAC/elacProjectA/project.tex

618 lines
19 KiB
TeX
Raw Permalink Normal View History

Finishing third task
2021-11-17 04:59:30 +01:00
\documentclass{report}[pt12]
first commit
2021-11-17 00:13:26 +01:00
\usepackage{amsmath}
\usepackage{tikz}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\usepackage[section]{placeins}
first commit
2021-11-17 00:13:26 +01:00
\usetikzlibrary{automata, arrows.meta, positioning}
\setcounter{chapter}{+1}
\title{Language and Automata, Assignment 1}
\author{Krzysztof Rudnicki\\ Student number: 307585}
\date{\today}
\begin{document}
\maketitle
\section{Regular expression}
We are given following regular expression:
\[ a^* + ba^*b + bba^*\]
\section{Examples of accepted strings}
\begin{enumerate}
\item $ \varepsilon $
\item a
\item bab
\item bba
\item bb
\end{enumerate}
\section{Building NFA using Thompson construction algorithm}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
\node (q0) [state, initial, initial text = {}] {$q_0$};
\node (q1) [state, accepting, right = of q0] {$q_1$};
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\end{tikzpicture}
\caption{Operator 'a'} \label{fig:operatorA}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
\node (q0) [state, initial, initial text = {}] {$q_2$};
\node (q1) [state, accepting, right = of q0] {$q_3$};
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\end{tikzpicture}
\caption{Operator 'b'} \label{fig:operatorB}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
\node (q0) [state, initial, initial text = {}] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, accepting, right = of q2] {$q_5$};
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\end{tikzpicture}
\caption{Operator '$a^*$'} \label{fig:operatorAstar}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\node (q6) [state, initial, initial text = {}] {$q_2$};
first commit
2021-11-17 00:13:26 +01:00
\node (q0) [state, right = of q6] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, accepting, right = of q2] {$q_5$};
\path [-stealth, thick]
(q6) edge node {$b$} (q0);
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\end{tikzpicture}
\caption{Operator '$ba^*$'} \label{fig:operatorbastar}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
\node (q6) [state, initial, initial text = {}] {$q_6$};
\node (q0) [state, right = of q6] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, right = of q2] {$q_5$};
\node (q7) [state, accepting, right = of q3] {$q_7$};
\path [-stealth, thick]
(q6) edge node {$b$} (q0);
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\path [-stealth, thick]
(q3) edge node {$b$} (q7);
\end{tikzpicture}
\caption{Operator '$ba^*b$'} \label{fig:operatorbastarb}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\node (q8) [state, initial, initial text = {}] {$q_2$};
\node (q9) [state, right = of q8] {$q_3$};
\node (q4) [state, accepting, right = of q9] {$q_{4}$};
first commit
2021-11-17 00:13:26 +01:00
\path [-stealth, thick]
(q8) edge node {$b$} (q9);
\path [-stealth, thick]
(q9) edge node {$b$} (q4);
\end{tikzpicture}
\caption{Operator '$bb$'} \label{fig:operatorbb}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\node (q8) [state, initial, initial text = {}] {$q_2$};
\node (q9) [state, right = of q8] {$q_3$};
first commit
2021-11-17 00:13:26 +01:00
\node (q0) [state, right = of q9] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, accepting, right = of q2] {$q_5$};
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\path [-stealth, thick]
(q8) edge node {$b$} (q9);
\path [-stealth, thick]
(q9) edge node {$b$} (q4);
\end{tikzpicture}
\caption{Operator '$bba^*$'} \label{fig:operatorbbastar}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
\node (q10) [state, initial, initial text = {}] {$q_{10}$};
% a*
\node (q0) [state, above right = of q10] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, right = of q2] {$q_5$};
% ba*b
\node (q4) [state, below right = of q10] {$q_6$};
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\node (q5) [state, right = of q4] {$q_8$};
\node (q6) [state, right = of q5] {$q_9$};
\node (q7) [state, right = of q6] {$q_{12}$};
\node (q8) [state, right = of q7] {$q_{13}$};
first commit
2021-11-17 00:13:26 +01:00
\node (q9) [state, right = of q8] {$q_7$};
\node (q11) [state, accepting, above right = of q9] {$q_{11}$};
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q0);
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q4);
% a*
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\path [-stealth, thick]
(q3) edge node {$\varepsilon$} (q11);
% ba*b
\path [-stealth, thick]
(q4) edge node {$b$} (q5);
\path [-stealth, thick]
(q5) edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
(q5) edge [bend right] node[below left] {$\varepsilon$} (q8);
\path [-stealth, thick]
(q6) edge node {a} (q7);
\path [-stealth, thick]
(q7) [bend left] edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
(q7) edge node {$\varepsilon$} (q8);
\path [-stealth, thick]
(q8) edge node {$b$} (q9);
\path [-stealth, thick]
(q9) edge node {$\varepsilon$} (q11);
\end{tikzpicture}
\caption{Operator '$a^*+ba^*b$'} \label{fig:operatorastarOrbastarb}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
first commit
2021-11-17 00:13:26 +01:00
\begin{tikzpicture} [node distance = 1.5cm, on grid, auto]
\node (q12) [state, initial, initial text = {}] {$q_{12}$};
\node (q10) [state, above right = of q12] {$q_{10}$};
% a*
\node (q0) [state, above right = of q10] {$q_4$};
\node (q1) [state, right = of q0] {$q_0$};
\node (q2) [state, right = of q1] {$q_1$};
\node (q3) [state, right = of q2] {$q_5$};
% ba*b
\node (q4) [state, below right = of q10] {$q_6$};
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\node (q5) [state, right = of q4] {$q_8$};
\node (q6) [state, right = of q5] {$q_9$};
\node (q7) [state, right = of q6] {$q_{12}$};
\node (q8) [state, right = of q7] {$q_{13}$};
first commit
2021-11-17 00:13:26 +01:00
\node (q9) [state, right = of q8] {$q_7$};
\node (q11) [state, above right = of q9] {$q_{11}$};
\node (q13) [state, accepting, below right = of q11] {$q_{13}$};
Finishing first two tasks
2021-11-17 04:13:22 +01:00
% bba*
\node (q14) [state, below right = of q12] {$q_{14}$};
\node (q15) [state, right = of q14] {$q_{15}$};
\node (q16) [state, right = of q15] {$q_{16}$};
\node (q17) [state, right = of q16] {$q_{17}$};
\node (q18) [state, right = of q17] {$q_{18}$};
\node (q19) [state, right = of q18] {$q_{19}$};
\path [-stealth, thick]
(q12) edge node {$b$} (q14);
\path [-stealth, thick]
(q14) edge node {$b$} (q15);
\path [-stealth, thick]
(q15) edge node {$b$} (q16);
\path [-stealth, thick]
(q16) edge node {$\varepsilon$} (q17);
\path [-stealth, thick]
(q16) edge [bend right] node[below left] {$\varepsilon$} (q19);
\path [-stealth, thick]
(q17) edge node {$a$} (q18);
\path [-stealth, thick]
(q18) edge node {$\varepsilon$} (q19);
\path [-stealth, thick]
(q18) [bend left] edge node {$\varepsilon$} (q17);
\path [-stealth, thick]
(q19) edge [bend right] node {$b$} (q13);
first commit
2021-11-17 00:13:26 +01:00
\path [-stealth, thick]
(q12) edge node {$\varepsilon$} (q10);
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q0);
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q4);
% a*
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\path [-stealth, thick]
(q3) edge node {$\varepsilon$} (q11);
% ba*b
\path [-stealth, thick]
(q4) edge node {$b$} (q5);
\path [-stealth, thick]
(q5) edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
Finishing first two tasks
2021-11-17 04:13:22 +01:00
(q5) edge [bend left] node[below left] {$\varepsilon$} (q8);
first commit
2021-11-17 00:13:26 +01:00
\path [-stealth, thick]
(q6) edge node {a} (q7);
\path [-stealth, thick]
(q7) [bend left] edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
(q7) edge node {$\varepsilon$} (q8);
\path [-stealth, thick]
(q8) edge node {$b$} (q9);
\path [-stealth, thick]
(q9) edge node {$\varepsilon$} (q11);
\path [-stealth, thick]
(q11) edge node {$\varepsilon$} (q13);
% bba*
\end{tikzpicture}
\caption{Operator '$a^*+ba^*b + bba^*$'} \label{fig:final}
\end{figure}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\begin{figure}[!htb]
\begin{tikzpicture} [node distance = 1.5cm, on grid, auto]
\node (q12) [state, initial, initial text = {}] {$q_{0}$};
\node (q10) [state, above right = of q12] {$q_{1}$};
% a*
\node (q0) [state, above right = of q10] {$q_3$};
\node (q1) [state, right = of q0] {$q_6$};
\node (q2) [state, right = of q1] {$q_9$};
\node (q3) [state, right = of q2] {$q_{12}$};
% ba*b
\node (q4) [state, below right = of q10] {$q_4$};
\node (q5) [state, right = of q4] {$q_7$};
\node (q6) [state, right = of q5] {$q_{10}$};
\node (q7) [state, right = of q6] {$q_{13}$};
\node (q8) [state, right = of q7] {$q_{15}$};
\node (q9) [state, right = of q8] {$q_{17}$};
\node (q11) [state, above right = of q9] {$q_{18}$};
\node (q13) [state, accepting, below right = of q11] {$q_{19}$};
% bba*
\node (q14) [state, below right = of q12] {$q_{2}$};
\node (q15) [state, right = of q14] {$q_{5}$};
\node (q16) [state, right = of q15] {$q_{8}$};
\node (q17) [state, right = of q16] {$q_{11}$};
\node (q18) [state, right = of q17] {$q_{14}$};
\node (q19) [state, right = of q18] {$q_{16}$};
\path [-stealth, thick]
(q12) edge node {$b$} (q14);
\path [-stealth, thick]
(q14) edge node {$b$} (q15);
\path [-stealth, thick]
(q15) edge node {$b$} (q16);
\path [-stealth, thick]
(q16) edge node {$\varepsilon$} (q17);
\path [-stealth, thick]
(q16) edge [bend right] node[below left] {$\varepsilon$} (q19);
\path [-stealth, thick]
(q17) edge node {$a$} (q18);
\path [-stealth, thick]
(q18) edge node {$\varepsilon$} (q19);
\path [-stealth, thick]
(q18) [bend left] edge node {$\varepsilon$} (q17);
\path [-stealth, thick]
(q19) edge [bend right] node {$b$} (q13);
\path [-stealth, thick]
(q12) edge node {$\varepsilon$} (q10);
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q0);
\path [-stealth, thick]
(q10) edge node {$\varepsilon$} (q4);
% a*
\path [-stealth, thick]
(q0) edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q0) edge [bend right] node[below left] {$\varepsilon$} (q3);
\path [-stealth, thick]
(q1) edge node {a} (q2);
\path [-stealth, thick]
(q2) [bend left] edge node {$\varepsilon$} (q1);
\path [-stealth, thick]
(q2) edge node {$\varepsilon$} (q3);
\path [-stealth, thick]
(q3) edge node {$\varepsilon$} (q11);
% ba*b
\path [-stealth, thick]
(q4) edge node {$b$} (q5);
\path [-stealth, thick]
(q5) edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
(q5) edge [bend left] node[below left] {$\varepsilon$} (q8);
\path [-stealth, thick]
(q6) edge node {a} (q7);
\path [-stealth, thick]
(q7) [bend left] edge node {$\varepsilon$} (q6);
\path [-stealth, thick]
(q7) edge node {$\varepsilon$} (q8);
\path [-stealth, thick]
(q8) edge node {$b$} (q9);
\path [-stealth, thick]
(q9) edge node {$\varepsilon$} (q11);
\path [-stealth, thick]
(q11) edge node {$\varepsilon$} (q13);
% bba*
\end{tikzpicture}
Finishing third task
2021-11-17 04:59:30 +01:00
\caption{Operator '$a^*+ba^*b + bba^*$' - changed names of states} \label{fig:finalBetter}
Finishing first two tasks
2021-11-17 04:13:22 +01:00
\end{figure}
first commit
2021-11-17 00:13:26 +01:00
\section{Transforming NFA into DFA using subset algorithm}
Finishing third task
2021-11-17 04:59:30 +01:00
I will use $\epsilon_{cl}$ instead of $\epsilon$-closure for brevity sake.
Final state - $\underline{q_{19}}$ was marked with an $\underline{underline}$ and so did all the states of DFA that contain it.
\[ A = \epsilon_{cl}(q_0) = (q_0, q_1, q_3, q_4, q_6, q_{12}, q_{18}, \underline{q_{19}}) = \underline{A} \]
Fixing task 3
2021-11-17 15:51:38 +01:00
\[ \epsilon_{cl}(move(\underline{A}, a)) = (\epsilon_{cl}(move(q_0, q_1, q_3, q_4, q_6, q_{12}, q_{18}, \underline{q_{19}}, a))) = \epsilon_{cl}(q_9) = (q_6, q_9, q_{12}, q_{18}, \underline{q_{19}}) = \underline{B} \]
\[ A = \epsilon_{cl}(move(\underline{A}, b)) = \epsilon_{cl}(move(q_0, q_1, q_3, q_4, q_6, q_{12}, q_{18}, \underline{q_{19}}, b))) = \epsilon_{cl}(q_2, q_7) = (q_2, q_7, q_{10}, q_{15}) = C \]
\[ \epsilon_{cl}(move(\underline{B}, a)) = \epsilon_{cl}(move(q_6, q_9, q_{12}, q_{18}, \underline{q_{19}}), a) = \epsilon_{cl}(q_9) = (q_6, q_9, q_{12}, q_{18}, \underline{q_{19}}) = \underline{B} \]
\[ \epsilon_{cl}(move(\underline{B}, b)) = \epsilon_{cl}(move(q_6, q_9, q_{12}, q_{18}, \underline{q_{19}}), b) = \emptyset \]
\[ \epsilon_{cl}(move(C, a)) = \epsilon_{cl}(move(q_2, q_7, q_{10}, q_{15}), a) = \epsilon_{cl}(q_{13}) = (q_{10}, q_{13}, q_{15}) = D \]
\[ \epsilon_{cl}(move(C, b)) = \epsilon_{cl}(move((q_2, q_7, q_{10}, q_{15}), b) = \epsilon_{cl}(q_{17}) = (q_{17}, q_{18}, \underline{q_{19}}) = \underline{E} \]
\[ \epsilon_{cl}(move(D, a)) = \epsilon_{cl}(move((q_{10}, q_{13}, q_{15}), a) = \epsilon_{cl}(q_{13}) = (q_{10}, q_{13}, q_{15}) = D \]
\[ \epsilon_{cl}(move(D, b)) = \epsilon_{cl}(move(q_{10}, q_{13}, q_{15}, b) = \epsilon_{cl}(q_{17}) = (q_{17}, q_{18}, \underline{q_{19}}) = \underline{E} \]
\[ \epsilon_{cl}(move(\underline{E}, a)) = \epsilon_{cl}(move(q_{17}, q_{18}, \underline{q_{19}}), a) = \epsilon_{cl}(\emptyset) = \emptyset \]
\[ \epsilon_{cl}(move(\underline{E}, b)) = \epsilon_{cl}(move(q_{17}, q_{18}, \underline{q_{19}}), b) = \epsilon_{cl}(\emptyset) = \emptyset \]
Finishing third task
2021-11-17 04:59:30 +01:00
\subsection{State table}
\begin{center}
\begin{tabular}{||c c c||}
\hline
State & a & b \\
\hline
$\underline{A}$ & $\underline{B}$ & C\\
\hline
Fixing task 3
2021-11-17 15:51:38 +01:00
$\underline{B}$ & $\underline{B}$ & $\emptyset$ \\
Finishing third task
2021-11-17 04:59:30 +01:00
\hline
C & D & $\underline{E}$\\
\hline
Fixing task 3
2021-11-17 15:51:38 +01:00
D & D & $\underline{E}$\\
Finishing third task
2021-11-17 04:59:30 +01:00
\hline
$\underline{E}$ & $\emptyset$ & $\emptyset$\\
\hline
$\emptyset$ & $\emptyset$ & $\emptyset$\\
\hline
\end{tabular}
\end{center}
\begin{figure}[!htb]
\centering
\begin{tikzpicture} [node distance = 2cm, on grid, auto]
Fixing task 3
2021-11-17 15:51:38 +01:00
\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$};
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q0) edge node {$a$} (q1);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q0) edge node {$b$} (q2);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q1) edge [loop] node {$a$} (q1);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q2) edge node {$b$} (q4);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q2) edge node {$b$} (q3);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q4) edge [bend right] node {$b$} (q3);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q4) edge [loop] node {$a$} (q4);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q1) edge [bend left] node {$a$} (q5);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q3) edge node {$a, b$} (q5);
Finishing third task
2021-11-17 04:59:30 +01:00
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q5) edge [loop] node {$a, b$} (q5);
Finishing third task
2021-11-17 04:59:30 +01:00
\end{tikzpicture}
\caption{DFA graph before minimalization} \label{dfaNominimalization}
\end{figure}
first commit
2021-11-17 00:13:26 +01:00
\section{Constructing minimal state DFA}
Finalizing project
2021-11-17 05:22:35 +01:00
\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);
Fixing task 3
2021-11-17 15:51:38 +01:00
\path [-stealth, thick]
(q1) edge [loop] node {$a$} (q1);
Finalizing project
2021-11-17 05:22:35 +01:00
\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]
Fixing task 3
2021-11-17 15:51:38 +01:00
(q3) edge [below loop] node {$a$} (q3);
\path [-stealth, thick]
(q3) edge node {$a$} (q5);
Finalizing project
2021-11-17 05:22:35 +01:00
\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}
first commit
2021-11-17 00:13:26 +01:00
\end{document}
Reference in New Issue Copy Permalink