Skip to content

{ Tag Archives } cpsc326

NFAs – non deterministic finite state automata

I am teaching Theoretical Foundations of Computer Science again, and so the exploration and explanation of nod-deterministic finite state automata is on my mind. Here are a few related links nfa lecture with proof that NFA <–> DFA (tags: nfa cpsc326) CMSC 451 Lecture 5, NFA with epsilon moves One of a series of […]

Also tagged

Mathematical Induction – again

Teaching the course titled Theoretical Foundations of Computing always presents the problem of (re)introducing studentens to the application and use of the Principle of Mathematical Induction. This link is to one discussion that I think will be helpful to my students. Section 1.6 Proof by Induction “The Principle of Mathematical Induction is a method of […]

Also tagged ,