L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNThe 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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
(Aucun exemplaire disponible)
Chercher: Créez une demandeSi vous ne trouvez pas un livre sur AbeBooks, nous le rechercherons automatiquement pour vous parmi les livres quotidiennement ajoutés au catalogue.
Créez une demande