1. Geffert V.,A representation of recursively enumerable languages by two homomorphisms and a quotient, to appear in Theoretical Computer Science
2. Geffert V.,Grammars with context dependency restricted to synchronization,Proceeding of MFCS'86,LNCS 233,Springer,1986, 370–378
3. Ginsburg S.,Algebraic and automata-theoretic properties of formal languages,North-Holland, Amsterdam,1975
4. Harrison M.A.,Introduction to formal language theory,Addison-Wesley,1978
5. Post E.L.,A variant of a recursively unsolvable problem,Bulletin of the American Math.Soc.,52,pp.264–268,1946