No abstract

This paper is a survey on logical aspects of nite automata. Central points are the connection between nite automata and monadic second-order logic, the Ehrenfeucht-Fra ss e t e c hnique in the context of formal language theory, nite automata on !-words and their determinization, and a self-contained proof of the \Rabin Tree Theorem".Sections 5 and 6 contain material presented in a lecture series to the \Final Winter School of AMICS" (Palermo, February 1996). A modi ed version of the paper will be a chapter of the \Handbook of Formal Language Theory", edited by G. Rozenberg and A. Salomaa, to appear in Springer-Verlag.

No abstract

No abstract

No abstract