eth-janishutz/eth-summaries
1
0
Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2025-11-25 10:34:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

[TI] Compact: Clarifications & spelling fixes

Browse Source
This commit is contained in:
Janis Hutz
2025-11-10 07:41:16 +01:00
parent bfd10cc1aa
commit 51653841e7
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
semester3/ti-compact/parts/02_finite-automata.tex
View File

@@ -146,8 +146,8 @@ Thus, all four words have to lay in pairwise distinct states and we thus need at
\subsection{Non-determinism}
The most notable differences between deterministic and non-deterministic FA is that the transition function maps is different: $\delta: Q \times \Sigma \rightarrow \cP(Q)$.
I.e., there can be any number of transitions for one symbol from $\Sigma$ from each state.
The most notable differences between deterministic and non-deterministic FA is that the transition function is different: $\delta: Q \times \Sigma \rightarrow \cP(Q)$.
I.e., there can be any number of transitions for one symbol of $\Sigma$ for each state.
This is (in graphical notation) represented by arrows that have the same label going to different nodes.
It is also possible for there to not be a transition function for a certain element of the input alphabet.