An excerpt from our script for theoretical computer science...
A really nice NFA xD

Would be nice if you could translate…

@runfrodorun Wie viele Unterhaltungsmöglichkeiten gibt es in die Nähe

@runfrodorun you said "I sleeping"

The graphics says: From a state z may exit multiple (or none) arrows with the same character a (see graphics).

Looks like a dfa to me

@runfrodorun
Ich = I
Einfschlafen = falling asleep

@devios1 he wanted to put an 'a' on both edges, but didn't, thus drawing a DFA instead of an NFA although he wanted to introduce NFAs :D

@dbeecham A DFA has to define transitions for all actions, on all states. So every state would have two outgoing arrows. A final states would for example have two transitions (a and b) pointing towards itself.

@Tobias We had the convention that you could leave out the "error state(s)": if the automaton in the picture would be a Regex matcher for the Regex "a|b" (assuming z' and z'' to be final states) the input of "c" (element of Sigma) would just be discarded.

@Tobias we had the convention that you skipped invalid states and had implicit transitions to a dead state for everything else