A compiler technology based approach to simulation of basic forms of automata

This dissertation formalizes a comprehensive approach based on compiler technology to simulate some basic forms of automata viz., finite accepters, finite transducers, pushdown accepters and Turing machines. These basic forms of automata are known for their simplicity and generality, hence widely studied and used in research.Facultad de Informátic