Mark V. Lawson

Finite Automata (eBook, ePUB)

• Format: ePub

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 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.

---

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 eBooks
• Erscheinungstermin: 17. September 2003
• Englisch
• ISBN-13: 9781040177129
• Artikelnr.: 73255914

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