Machines, Languages, and Complexity

53.49 €

Order
Machines, Languages, and Complexity
The volume contains selected contributions from the scientific programme of the 5th International Meeting of Young Computer Scientists (IMYCS '88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions dealing with problems of decidability, hierarchy, and complexity. Papers concerning different types and problems of automata theory form the second chapter. The contributions in the third chapter cover the large field of algorithmics from the study of program complexity to the domain of computational geometry. The two contributions of the fourth chapter are devoted to logic programming and inductive inference. The final chapter deals with problems of cryptography and contains the text of the IMYCS '88 tutorial on cryptography and data security delivered by A. Salomaa. The book will be a useful source for orientation in contemporary theoretical computer science and related fields such as software engineering and artificial intelligence for researchers and graduate students.

More from the series "Lecture Notes in Computer Science"

Log in to get access to this book and to automatically save your books and your progress.

Purchase this book or upgrade to dav Pro to read this book.

When you buy this book, you can access it regardless of your plan. You can also download the book file and read it in another app or on an Ebook reader.

80 % of the price goes directly to the author.

ISBN: 9783540515166

Language: English

Publication date: 09.08.1989

Number of pages: 248

Our shipping costs are a flat rate of €2.50, regardless of the order.
Currently, we only ship within Germany.

Shipping is free for PocketLib Pro users.

An error occured. Please check your internet connection or try it again later.