Mark V. Lawson

Finite Automata (eBook, PDF)

• Format: PDF

Produktbeschreibung

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 upper-level students in both mathematics and theoretical computer science. This book--the first of its kind--presents a well-motivated introduction to finite automata and semigroup theory and that will serve as a firm foundation for those wishing to pursue the many applications of finite automata in mathematics, such as combinatorial group theory and symbolic dynamics, or in theoretical computer science. The author develops the underlying algebra gently but rigorously and includes more than 200 exercises with hints and solutions.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 320
• Erscheinungstermin: 17. September 2003
• Englisch
• ISBN-13: 9781482285840
• Artikelnr.: 57530854

Autorenporträt

Lawson, Mark V.

Inhaltsangabe

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