Skip to main content
  • Conference proceedings
  • © 1997

Automata, Languages and Programming

24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings

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

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 1997.

Buy it now

Buying options

Softcover Book USD 109.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

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

Table of contents (79 papers)

  1. Front Matter

  2. Graphical calculi for interaction

    • Robin Milner
    Pages 1-1
  3. NP-completeness: A retrospective

    • Christos H. Papadimitriou
    Pages 2-6
  4. The LEDA platform for combinatorial and geometric computing

    • Kurt Mehlhorn, Stefan Näher, Christian Uhrig
    Pages 7-16
  5. The Wadge-Wagner hierarchy of ω-rational sets

    • Olivier Carton, Dominique Perrin
    Pages 17-35
  6. DNA2DNA computations: A potential “killer app”?

    • Laura F. Landweber, Richard J. Lipton
    Pages 56-64
  7. Tilings and quasiperiodicity

    • Bruno Durand
    Pages 65-75
  8. Enumerative sequences of leaves in rational trees

    • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
    Pages 76-86
  9. The expressibility of languages and relations by word equations

    • Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
    Pages 98-109
  10. Finite loops recognize exactly the regular open languages

    • Martin Beaudry, François Lemieux, Denis Thérien
    Pages 110-120
  11. An abstract data type for real numbers

    • Pietro Di Gianantonio
    Pages 121-131
  12. Recursive computational depth

    • James I. Lathrop, Jack H. Lutz
    Pages 132-142
  13. Monadic simultaneous rigid E-unification and related problems

    • Yuri Gurevich, Andrei Voronkov
    Pages 154-165
  14. Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs

    • Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Pages 177-187
  15. Results on resource-bounded measure

    • Harry Buhrman, Stephen Fenner, Lance Fortnow
    Pages 188-194

Other Volumes

  1. Automata, Languages and Programming

About this book

This book constitutes the refereed proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP '97, held in Bologna, Italy, in July 1997. ICALP '97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972.
The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited contributions. ICALP is one of the few flagship conferences in the area. The book addresses all current topics in theoretical computer science.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 109.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