Cantitate/Preț
Produs

Finite Automata

Autor Mark V. Lawson
en Limba Engleză Paperback – 25 sep 2019
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: 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 36814 lei  6-8 săpt.
  CRC Press – 25 sep 2019 36814 lei  6-8 săpt.
Hardback (1) 56457 lei  6-8 săpt.
  CRC Press – 17 sep 2003 56457 lei  6-8 săpt.

Preț: 36814 lei

Preț vechi: 47719 lei
-23% Nou

Puncte Express: 552

Preț estimativ în valută:
7045 7411$ 5879£

Carte tipărită la comandă

Livrare economică 09-23 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780367394998
ISBN-10: 0367394995
Pagini: 320
Dimensiuni: 156 x 234 x 18 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC

Cuprins

Introduction to Finite Automata. Recognisable Languages. Non-Deterministic Automata. e-Automata. Kleene's Theorem. Local Languages. Minimal Automata. The Transition Monoid. The Syntactic Monoid. Algebraic Language Theory. Star-Free Languages. Varieties of Languages. Appendix: Discrete Mathematics. Bibliography. Index

Descriere

Interest in semigroup theory and automata is currently on the rise, and the ideas of finite automata are becoming more accepted by the mathematical community. The time is right to begin introducing those ideas to students in mathematics and theoretical computer science. This book presents a well-motivated introduction to finite automata and semigroup theory and makes clear connections to other areas, including combinatorial group theory and symbolic dynamics as well as formal language theory and aspects of theoretical computer science. The author develops the underlying algebra gently but rigorously and includes more than 200 exercises with hints and solutions.