Machines, Languages, and Complexity

5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988. Selected Contributions

Jürgen Dassow, Jozef Kelemen (Herausgeber)

Buch | Softcover

VIII, 248 Seiten

1989 | 1989
Springer Berlin (Verlag)
978-3-540-51516-6 (ISBN)

Artikel merken

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.

Questions of decidability for context-free chain code picture languages.- Chomsky hierarchy and communication complexity.- Complexity theory and formal languages.- Rational cones and commutations.- A remark on some classifications of Indian parallel languages.- An extension of the Krohn-Rhodes decomposition of automata.- A survey of two-dimensional automata theory.- The simulation of two-dimensional one-marker automata by three-way turing machines.- Some properties of space-bounded synchronized alternating turing machines with only universal states.- The virtual floating grid file.- A partially persistent data structure for the set-union problem with backtracking.- A note on the computational complexity of bracketing and related problems.- Postorder hierarchy for path compressions and set union.- The convex hull problem on grids computational and combinatorial aspects.- The riches of rectangles.- The limitations of partial evaluation.- Algorithmic learning from incomplete information: Principles and problems.- A cryptosystem based on propositional logic.- Tutorial: Cryptography and data security.

Erscheint lt. Verlag	9.8.1989
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VIII, 248 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	468 g
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
	Informatik ► Weitere Themen ► Hardware
Schlagworte	Abstract Machines • algorithm • algorithms • Artificial Intelligence • Automat • Automata • Automata Theory • Automatentheorie • Automatische Spracherkennung • Complexity • Complexity theory • Computational Geometry • formale Sprachen • Formal Languages • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Inductive Inference • Induktives Schließen • Informatik • Intelligence • Komplexität (Kybern.) • Komplexitätstheorie • Künstliche Intelligenz • Logic • Logic Programming • Logisches Programmieren • programming • Software Engineering / Softwareentwicklung • Softwareentwicklung
ISBN-10	3-540-51516-X / 354051516X
ISBN-13	978-3-540-51516-6 / 9783540515166
Zustand	Neuware