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.
 P. Chakraborty, P. C. Saxena and C. P. Katti, “Fifty years of automata simulation: a review,” ACM Inroads,
2011, 2(4): 59-70.
 P. Chakraborty, P. C. Saxena and C. P. Katti, “A compiler-based toolkit to teach and learn finite automata,” Computer Applications in Engineering Education, in press.
 P. Chakraborty, “A language for easy and efficient modeling of Turing machines,” Progress in Natural
Science, 2007, 17(7): 867-871.
 P. Chakraborty, S. Taneja, P. C. Saxena and C. P. Katti, “Teaching purpose compilers – an exercise and its
feedback,” ACM Inroads, 2011, 2(2): 47-51.