The Chomsky hierarchy categorises languages into collections according to their difficulty.
| Type | Abstract Machine |
|---|---|
| Type-0 | Turing Machine |
| Type-1 | Linear-bounded Turing Machine |
| Type-2 | Pushdown Automata |
| Type-3 | Finite Automata |
Each level has varying memory capabilities.