Mark V. Lawson

Finite Automata (eBook, PDF)

• Format: PDF

Produktbeschreibung

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

---

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