Detalls del llibre
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: Schützenberger's Theorem on star-free languages and the variety theorem of Eilenberg and Schützenberger.
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.
- Autor/a Revd Mark Lawson-Jones
- ISBN13 9781584882558
- ISBN10 1584882557
- Pàgines 320
- Any Edició 2003
- Fecha de publicación 17/09/2003
Ressenyes i valoracions
Finite Automata
- De
- Revd Mark Lawson-Jones
- |
- Routledge (2003)
- 9781584882558



