Read more
Zusatztext "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News! Vol. 25! No. 4! December 2001) Informationen zum Autor Du is now, by Deed Poll, my legal name, since October 2002. End 2020, turned 70, all threescore-and-ten. Schizophrenic by professional qualification, free man by occupation, ordinary individual by better judgement, happy by orientation, philosopher by the hustle, poet by the score, arsefucker by default, Du by all indications. NOT so easily fooled by this little world, and its story, on the NOT-Du side of things, I write and self-publish, poetry, books for fun, for a hobby. Klappentext Sprachtheorie, Automata und Komplexitätstheorie - zentrale Themenkreise der Informatik - stehen im Mittelpunkt dieses Bandes. Zwei anerkannte Experten bieten Ihnen hier eine praxisnahe, gut lesbare und auf die Problemlösung orientierte Einführung. Durchgearbeitete Beispiele und Übungsaufgaben helfen beim Vertiefen des Stoffes. Zusammenfassung Language theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills. Inhaltsverzeichnis Preface. Leverages. Finite Automata. Context-Free Languages. Turing Machines. Computability Theory. Computational Complexity. NP-Completeness. References. Index.
List of contents
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
Report
"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text..." (IEEE Circuits & Devices, July/August 2004)
"...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)
