We refer to [1]} for standard definitions and well known results from formal language theory regarding e.g. recursively enumerable languages (\(\operatorname{RE}\) ), regular languages (\(\operatorname{REGLang}\) ), context free languages (\(\operatorname{CFLang}\) ), deterministic context-free languages (\(\operatorname{DCFLang}\) ), finite and pushdown automata, etc.
