Books > Science & Mathematics > Mathematics > Algebra
|
Buy Now
Finite Automata (Paperback)
Loot Price: R1,930
Discovery Miles 19 300
|
|
Finite Automata (Paperback)
Expected to ship within 12 - 17 working days
|
Interest in finite automata theory continues to grow, not only
because of its applications in computer science, but also because
of more recent applications in mathematics, particularly group
theory and symbolic dynamics. The subject itself lies on the
boundaries of mathematics and computer science, and with a balanced
approach that does justice to both aspects, this book provides a
well-motivated introduction to the mathematical theory of finite
automata. The first half of Finite Automata focuses on the computer
science side of the theory and culminates in Kleene's Theorem,
which the author proves in a variety of ways to suit both computer
scientists and mathematicians. In the second half, the focus shifts
to the mathematical side of the theory and constructing an
algebraic approach to languages. Here the author proves two main
results: Schutzenberger's Theorem on star-free languages and the
variety theorem of Eilenberg and Schutzenberger. Accessible even to
students with only a basic knowledge of discrete mathematics, this
treatment develops the underlying algebra gently but rigorously,
and nearly 200 exercises reinforce the concepts. Whether your
students' interests lie in computer science or mathematics, the
well organized and flexible presentation of Finite Automata
provides a route to understanding that you can tailor to their
particular tastes and abilities.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.