Regular Languages.

Regular languages: From automata to logic and back

Madhavan Mukund

Math Unlimited: Essays in Mathematics
H.N. Ramaswamy, R. Sujatha and C.S. Yogananda (eds), Science Publishers (2011) to appear.


Abstract

Around the late 1950's, a deep connection was identified between finite automata and mathematical logic, which has since played a central role in computer science. The aim of this article is to provide a quick introduction to some aspects of this elegant theory.


Available as PDF.
Back to Madhavan Mukund's home page.