Is the specification / definition of an automaton (like a turing machine) a type of algorithm?
All regular languages can be constructed from performing operations on elementary languages?