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

  • Pinaki Chakraborty School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India

Abstract

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.

Downloads

Download data is not yet available.

References

[1] P. Chakraborty, P. C. Saxena and C. P. Katti, “Automata simulators: classic tools for computer science education,” British Journal of Educational Technology, 2012, 43(1): E11-E13.
[2] P. Chakraborty, P. C. Saxena and C. P. Katti, “Fifty years of automata simulation: a review,” ACM Inroads,
2011, 2(4): 59-70.
[3] 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.
[4] P. Chakraborty, “A language for easy and efficient modeling of Turing machines,” Progress in Natural
Science, 2007, 17(7): 867-871.
[5] 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.
Published
2013-10-01
How to Cite
Chakraborty, P. (2013). A compiler technology based approach to simulation of basic forms of automata. Journal of Computer Science and Technology, 13(02), p. 103-104. Retrieved from http://journal.info.unlp.edu.ar/JCST/article/view/624
Section
Thesis Overview