Be A = {$\displaystyle A_n$ | n $\displaystyle \in$ N} a countable set of Stockitems. and

$\displaystyle (Frml)_A $ = { φ | φ is a formula with stockitems of A. }

Find a finite alphabet Σ, a embedding i : $\displaystyle Frml_A $--> Σ*

and a deterministic $\displaystyle n^k$ - time- turing machine M (for adequate k $\displaystyle \in$ N, so A(M) = {i(φ|φ $\displaystyle \in Frml_A$ }.

A rough sketch of the turingprogramm is enough. I have to give an estimation up for the runtime of my program.

Can someone help me, I dont even know how to start this exercise

Every help would be appreciated