Finite Automata
Autor Mark V. Lawsonen Limba Engleză Paperback – 25 sep 2019
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 368.14 lei 6-8 săpt. | |
CRC Press – 25 sep 2019 | 368.14 lei 6-8 săpt. | |
Hardback (1) | 564.57 lei 6-8 săpt. | |
CRC Press – 17 sep 2003 | 564.57 lei 6-8 săpt. |
Preț: 368.14 lei
Preț vechi: 477.19 lei
-23% Nou
Puncte Express: 552
Preț estimativ în valută:
70.45€ • 74.11$ • 58.79£
70.45€ • 74.11$ • 58.79£
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
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.