Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1996

Automata, Languages and Programming

23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings

Editors:

  1. Friedhelm Meyer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Burkhard Monien
    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 1099)

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

Conference proceedings info: ICALP 1996.

Sections

Buy it now

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 (56 papers)

  1. Front Matter

    PDF

  2. Saturation-based theorem proving (abstract)

    • Harald Ganzinger
    Pages 1-3

  3. Bandwidth efficient parallel computation

    • Abhiram Ranade
    Pages 4-23

  4. Variable-length maximal codes

    • Véronique Bruyère, Michel Latteux
    Pages 24-47

  7. Fast asynchronous systems in dense time

    • Lars Jenner, Walter Vogler
    Pages 75-86

  8. A hierarchy theorem for the μ-calculus

    • Giacomo Lenzi
    Pages 87-97

  9. An effective tableau system for the linear time μ-calculus

    • Julian Bradfield, Javier Esparza, Angelika Mader
    Pages 98-109

  12. A complete gentzen-style axiomatization for set constraints

    • Allan Cheng, Dexter Kozen
    Pages 134-145

  13. Fatal errors in conditional expressions

    • Michel Billaud
    Pages 146-157

  16. Regularity for a large class of context-free processes is decidable

    • D. J. B. Bosscher, W. O. D. Griffioen
    Pages 182-193

  18. Semi-groups acting on context-free graphs

    • Géraud Sénizergues
    Pages 206-218

  20. Random polynomials and polynomial factorization

    • Philippe Flajolet, Xavier Gourdon, Daniel Panario
    Pages 232-243
Back to top

Other Volumes

  1. Automata, Languages and Programming

Back to top

About this book

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).
The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation