Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 12, | International Colloquium on Automata, Languages, and Programming (23rd : 1996 : Szeged, Hungary)
Share on TelegramAutomata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8 12,
Author: International Colloquium on Automata, Languages, and Programming (23rd : 1996 : Szeged, Hungary)
Added by: station26.cebu
Added Date: 2020-09-24
Publication Date: 1996
Language: eng
Subjects: Machine theory -- Congresses, Formal languages -- Congresses, Computer programming -- Congresses, Automates mathématiques, Théorie des -- Congrès, Langages formels -- Congrès, Programmation (Informatique) -- Congrès, Computer programming, Formal languages, Machine theory, Abstracte automaten More
Publishers: Berlin ; New York : Springer-Verlag
Collections: internetarchivebooks, printdisabled, inlibrary
ISBN Number: 3540614400, 9783540614401
Pages Count: 702
PPI Count: 300
PDF Count: 2
Total Size: 1.37 GB
PDF Size: 64.39 MB
Extensions: lcpdf, pdf, gz, log, epub, html, zip, mrc, tar
Contributor: Internet Archive
Access Restricted Item: true
Downloads: 18
Views: 68
Total Files: 31
Media Type: texts
Description
"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