Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Typos

Browse Source
This commit is contained in:
Mark
2023-12-09 18:17:22 -08:00
parent a5362a2eb9
commit 6a5e02a8ac
27 changed files with 36 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Advanced/DFAs/parts/0 DFA.tex
View File

@ -510,7 +510,7 @@ Draw a state diagram for a DFA over an alphabet of your choice that accepts exac
\end{tikzpicture}
\end{center}
This automaton rejects all strings with three \texttt{'a'}s in a row. If we count accepted strings, we get the Tribonacci numbers with an offest: $f(0) = 1$, $f(1) = 2$, $f(2)=4$, ... \par
This automaton rejects all strings with three \texttt{'a'}s in a row. If we count accepted strings, we get the Tribonacci numbers with an offset: $f(0) = 1$, $f(1) = 2$, $f(2)=4$, ... \par
\pagebreak