Are Regular Languages (as we represent by Finite State Machines) Fields?
No, the set of regular languages is not a field, but it is a boolean algebra.  It also qualifies as a field of sets -- but note that the term "field of sets" has nothing to do with the notion of a "field"; it's an unfortunate name collision.  See also https://en.wikipedia.org/wiki/Boolean_algebra_(structure).