The simplest and most mathematically rigid tier of the hierarchy involves regular languages. These are languages that can be recognized by machines with a strictly finite number of states and no external memory storage. Deterministic vs. Non-Deterministic Models