Automata, Languages and Programming : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings. 1st ed. 1996

種類:

電子ブック

責任表示:

edited by Friedhelm Meyer auf der Heide, Burkhard Monien

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1996

著者名:

• Meyer auf der Heide, Friedhelm.
• Monien, Burkhard.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 1099

ISBN:

9783540685807 [3540685804]    

注記:

Saturation-based theorem proving (abstract) -- Bandwidth efficient parallel computation -- Variable-length maximal codes -- Lower bounds for prepositional proofs and independence results in bounded arithmetic -- Algebraic characterizations of decorated trace equivalences over tree-like structures -- Fast asynchronous systems in dense time -- A hierarchy theorem for the ?-calculus -- An effective tableau system for the linear time ?-calculus -- Characterizing fairness implementability for multiparty interaction -- Termination of context-sensitive rewriting by rewriting -- A complete gentzen-style axiomatization for set constraints -- Fatal errors in conditional expressions -- Different types of arrow between logical frameworks -- Effective models of polymorphism, subtyping and recursion (extended abstract) -- Regularity for a large class of context-free processes is decidable -- On infinite transition graphs having a decidable monadic theory -- Semi-groups acting on context-free graphs -- Hard sets method and
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...

ローカル注記:

学内専用E-BOOKS (local access only)