Language Concepts

Any regular expression can be expressed as a Context Free Grammar Let $fx=x4$ is an example of a higher order function All statically typed languages use explicit $($manifest$)$ typing FSMs are a subset of Turing Machines in terms of computational power