xii, 680 pages : 24 cm, "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 ..."--PUBLISHER'S WEBSITE, Includes bibliographical references and author index, Saturation-Based Theorem Proving / H. Ganzinger -- Bandwidth Efficient Parallel Computation / A. Ranade -- Variable-Length Maximal Codes / V. Bruyere and M. Latteux -- Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic / A.A. Razborov -- Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures / X.J. Chen and R. De Nicola -- Fast Asynchronous Systems in Dense Time / L. Jenner and W. Vogler -- A Hierarchy Theorem for the [mu]-Calculus / G. Lenzi -- An Effective Tableau System for the Linear Time [mu]-Calculus / J. Bradfield, J. Esparza and A. Mader -- Characterizing Fairness Implementability for Multiparty Interaction / Y.-J. Joung -- Termination of Context-Sensitive Rewriting by Rewriting / S. Lucas -- A Complete Gentzen-style Axiomatization for Set Constraints / A. Cheng and D. Kozen -- Fatal Errors in Conditional Expressions / M. Billaud -- Different Types of Arrow Between Logical Frameworks / T. Mossakowski