Due to my poor eyesight for today, I'm unable to write everything down, so I'll recall with my memory of today's lecture.
So we started to prove that a Deterministic Finite State Automata (DFSA) is correct given what the machine supposed to do and a proper string in the alphabet. The prove itself, like the proof of correctness, is rather long but not hard.
Next, we went on to the definition of NFSA (what's the N stands for anyways?), which I (unfortunately) can't see too clearly what it is about, I assume it is quite similar to that of the DFSA.
I'll take a break today, got to rest my eyes.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment