Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
99,95 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Kategorien:
Beschreibung
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.
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.
Über den Autor
Lawson, Mark V.
Inhaltsverzeichnis
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
Details
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Betriebssysteme & Benutzeroberflächen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
ISBN-13: | 9780367394998 |
ISBN-10: | 0367394995 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Lawson, Mark V. |
Hersteller: | Chapman and Hall/CRC |
Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
Maße: | 234 x 156 x 17 mm |
Von/Mit: | Mark V. Lawson |
Erscheinungsdatum: | 25.09.2019 |
Gewicht: | 0,488 kg |
Über den Autor
Lawson, Mark V.
Inhaltsverzeichnis
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
Details
Erscheinungsjahr: | 2019 |
---|---|
Fachbereich: | Betriebssysteme & Benutzeroberflächen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
ISBN-13: | 9780367394998 |
ISBN-10: | 0367394995 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Lawson, Mark V. |
Hersteller: | Chapman and Hall/CRC |
Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
Maße: | 234 x 156 x 17 mm |
Von/Mit: | Mark V. Lawson |
Erscheinungsdatum: | 25.09.2019 |
Gewicht: | 0,488 kg |
Sicherheitshinweis