Some formal definitions from class about FSA

A finite automoton is a 5-tuple (Q, E, delta, q0, F)
(We are using E for Sigma)

1. Q is a set of states
2. E is set called the alphabet
3. delta: Q X E -> Q is the transition function
4. q0 an element in Q is the start state
5. F subset of Q is the set of accept states

If A is the set of all strings accepted by FSM M, then Machine M recognizes A; could say accepts A. A is the language of machine M.

Also, we finished chapter 2's coverage of the FORTRANs, in the Concepts of Programming Languages book.