Skip to main content
SpringerLink
Log in

Machines, Languages, and Complexity

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

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. J. Dassow
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. Kelemen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 381)

Included in the following conference series:

Conference proceedings info: IMYCS 1988.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Questions of decidability for context-free chain code picture languages

    • Friedheld Hinz
    Pages 1-11

  3. Chomsky hierarchy and communication complexity

    • Galina Jirásková
    Pages 12-18

  4. Complexity theory and formal languages

    • Klaus-Jörn Lange
    Pages 19-36

  5. Rational cones and commutations

    • Michel Latteux
    Pages 37-54

  6. A remark on some classifications of Indian parallel languages

    • Bernd Reichel
    Pages 55-63

  7. An extension of the Krohn-Rhodes decomposition of automata

    • Zoltán Esik
    Pages 65-71

  8. A survey of two-dimensional automata theory

    • Katsushi Inoue, Itsuo Takanami
    Pages 72-91

  9. The simulation of two-dimensional one-marker automata by three-way turing machines

    • Akira Ito, Katsushi Inoue, Itsuo Takanami
    Pages 92-101

  10. Some properties of space-bounded synchronized alternating turing machines with only universal states

    • Anna Slobodová
    Pages 102-113

  11. The virtual floating grid file

    • Daniele Cortolezzis
    Pages 115-127

  12. A partially persistent data structure for the set-union problem with backtracking

    • Carlo Gaibisso
    Pages 128-135

  13. A note on the computational complexity of bracketing and related problems

    • Mirko KÅ™ivánek
    Pages 136-145

  14. Postorder hierarchy for path compressions and set union

    • Martin Loebl, Jaroslav NeÅ¡etÅ™il
    Pages 146-151

  15. The convex hull problem on grids computational and combinatorial aspects

    • Kristel Unger
    Pages 152-160

  16. The riches of rectangles

    • Derick Wood
    Pages 161-168

  17. The limitations of partial evaluation

    • Frank van Harmelen
    Pages 169-187

  18. Algorithmic learning from incomplete information: Principles and problems

    • Klaus P. Jantke
    Pages 188-207

  19. A cryptosystem based on propositional logic

    • Jarkko Kari
    Pages 209-219

  20. Tutorial: Cryptography and data security

    • Arto Salomaa
    Pages 220-244
Back to top

Other volumes

  1. Machines, Languages, and Complexity

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation