Beschreibung
Following a general discussion of formal languages, their descriptions, and borderline cases of recognizability, the chapter covers regular languageswhich find their most important application in the lexical definition of programming languagesas well as context-free languages, which are used to define the syntax of programming languages. From a theoretical perspective, the clear correspondence between language description and language recognition is satisfyingfinite automata correspond to regular languages, and pushdown automata correspond to context-free languages. Further levels of the Chomsky hierarchy are only briefly covered, as they are of lesser practical importance. Instead, a separate chapter on compiler design highlights additional techniques for deriving a parserthat is, the complete "front end" of a compilerfrom a language description. The concept of an "algorithm" is explained using various machine models, and Churchs thesisthat every reasonable definition of "computability" leads to the same class of functionsis also confirmed. The limits of what is algorithmically feasible are clearly delineated using the halting problem and Rices theorem. The concluding chapter on complexity theory explores, among solvable problems, the boundary between those that can be solved with reasonable (polynomial) effort and those whose solution is not significantly more efficient than systematically trying out candidate solutions. This chapter leads the reader to the most famous unsolved problem in theoretical computer science: P = NP?The first volume of Computer Science explains the fundamental concepts: programming, algorithms, and data structures. The second volume is devoted to technical topicsin particular, computer architecture, operating systems, computer networks, and specifically the Internet.The book is intended for all beginners who wish to seriously engage with computer science, whether for self-study or to accompany lectures. The subsequent volumes of this book explore the topics of computer architecture, operating systems, computer networks, the Internet, compiler design, and theoretical computer science in greater depth. Prof. Dr. Heinz-Peter Gummis a professor of theoretical computer science in Marburg. After completing his studies in Darmstadt and Winnipeg (Canada) from 1970 to 1975 and earning his habilitation in 1981, he held professorships in Hawaii, California, and New York. His research areas include formal methods, general algebras, and coalgebras. Prof. Dr. Manfred Sommeris Professor Emeritus of Practical Computer Science in Marburg. After completing his studies in Göttingen and Munich from 1964 to 1969, he served as an assistant at Germanys first computer science institute at the Technical University of Munich. This was followed by ten years at Siemens in Munich, and from 1984 to 2014 he was a professor of computer science in Marburg.
Autorenporträt
Heinz-Peter Gumm, Manfred Sommer, University of Marburg.
Herstellerkennzeichnung:
Walter de Gruyter GmbH
De Gruyter GmbH
Genthiner Strasse 13
10785 Berlin
DE
E-Mail: productsafety@degruyterbrill.com




































































































