GENIOMHE
/
sequence-algorithms
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix: Definition on automata

This commit is contained in:
Samuel Ortion 2024-04-02 15:05:56 +02:00
parent 80f4669d23
commit 020c1b7497
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
content/chapters/part1/1.tex
View File

@ -279,11 +279,11 @@ An automaton is a tuple $\langle S, s_{0}, T, \Sigma,f\rangle$
\paragraph{Example} Given the language $L$ on the alphabet $\Sigma = \{A, C, T\}$, $L = \{A^{*}, CTT, CA^{*}\}$ \paragraph{Example} Given the language $L$ on the alphabet $\Sigma = \{A, C, T\}$, $L = \{A^{*}, CTT, CA^{*}\}$
\begin{definition}[Deterministic automaton] \begin{definition}[Deterministic automaton]
An automaton is deterministic, if for each couple $(p, a) \in S \times \Sigma$ it exists at most a state $q$ such as $f(p, q) = q$ An automaton is deterministic, if for each couple $(p, a) \in S \times \Sigma$ it exists at most a state $q$ such as $f(p, a) = q$
\end{definition} \end{definition}
\begin{definition}[Complete automaton] \begin{definition}[Complete automaton]
An automaton is complete, if for each couple $(p, a) \in S \times \Sigma$ it exists at least a state $q$ such as $f(p, q) = q$. An automaton is complete, if for each couple $(p, a) \in S \times \Sigma$ it exists at least a state $q$ such as $f(p, a) = q$.
\end{definition} \end{definition}
\begin{algorithm} \begin{algorithm}

BIN
main.pdf (Stored with Git LFS)
View File

Binary file not shown.