Theory of Automata PDF

by Arto Salomaa

Edited by I. N. Sneddon, M. Stark, J. P. Kahane

Part of the ISSN series

PDF

Download - Immediately Available

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Theory of Automata deals with mathematical aspects of the theory of automata theory, with emphasis on the finite deterministic automaton as the basic model.

All other models, such as finite non-deterministic and probabilistic automata as well as pushdown and linear bounded automata, are treated as generalizations of this basic model.

The formalism chosen to describe finite deterministic automata is that of regular expressions.

A detailed exposition regarding this formalism is presented by considering the algebra of regular expressions. This volume is comprised of four chapters and begins with a discussion on finite deterministic automata, paying particular attention to regular and finite languages; analysis and synthesis theorems; equivalence relations induced by languages; sequential machines; sequential functions and relations; definite languages and non-initial automata; and two-way automata.

The next chapter describes finite non-deterministic and probabilistic automata and covers theorems concerning stochastic languages; non-regular stochastic languages; and probabilistic sequential machines.

The book then introduces the reader to the algebra of regular expressions before concluding with a chapter on formal languages and generalized automata.

Theoretical exercises are included, along with ""problems"" at the end of some sections. This monograph will be a useful resource for beginning graduate or advanced undergraduates of mathematics.