Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Andrzej Lingas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rolf Karlsson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Svante Carlsson
    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 700)

Included in the following conference series:

Conference proceedings info: ICALP 1993.

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (56 papers)

  1. Lower bounds for one-way probabilistic communication complexity

    • Farid Ablayev
    Pages 241-252

  2. Maintaining discrete probability distributions optimally

    • Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
    Pages 253-264

  3. Secure and efficient off-line digital money (extended abstract)

    • Matthew Franklin, Moti Yung
    Pages 265-276

  4. Computational depth and reducibility

    • David W. Juedes, James I. Lathrop, Jack H. Lutz
    Pages 277-288

  5. Learnability: Admissible, co-finite, and hypersimple languages

    • Ganesh Baliga, John Case
    Pages 289-300

  6. Inclusion is undecidable for pattern languages

    • Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
    Pages 301-312

  7. New decidability results concerning two-way counter machines and applications

    • Oscar H. Ibarra, Tao Jiang, Nicholas Tran, Hui Wang
    Pages 313-324

  8. Cobham's Theorem seen through Büchi's Theorem

    • Christian Michaux, Roger Villemaire
    Pages 325-334

  9. Logical definability on infinite traces

    • Werner Ebinger, Anca Muscholl
    Pages 335-346

  10. Algebras for classifying regular tree languages and an application to frontier testability

    • Thomas Wilke
    Pages 347-358

  11. Finite automata as characterizations of minor closed tree families (extended abstract)

    • Arvind Gupta
    Pages 359-370

  12. On distributed algorithms in a broadcast domain

    • Danny Dolev, Dalia Malki
    Pages 371-387

  13. Sparse networks supporting efficient reliable broadcasting

    • Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Pages 388-397

  14. Strongly adaptive token distribution

    • Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka
    Pages 398-409

  15. Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic

    • Arnold Schönhage
    Pages 410-417

  16. Fast parallel constraint satisfaction

    • Lefteris M. Kirousis
    Pages 418-429

  17. The product of rational languages

    • Imre Simon
    Pages 430-444

  18. On regular compatibility of semi-commutations

    • Edward OchmaÅ„ski, Pierre-André Wacrenier
    Pages 445-456

  19. Algebraic aspects of B-regular series

    • Ph. Dumas
    Pages 457-468

  20. Products of finite state machines with full coverage

    • David M. Cohen, Michael L. Fredman
    Pages 469-477
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

About this book

The International Colloquium on Automata, Languages and Programming (ICALP) is an annual conference series sponsored by the European Association for Theoretical Computer Science (EATCS). It is intended to cover all important areas of theoretical computer science, such as: computability, automata,formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logicprogramming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, and theory of robotics. This volume contains the proceedings of ICALP 93, held at LundUniversity, Sweden, in July 1993. It includes five invited papers and 51 contributed papers selected from 151 submissions.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation