


default search action
3rd ICALP 1976: Edinburgh, UK
- S. Michaelson, Robin Milner:

Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, UK, July 20-23, 1976. Edinburgh University Press 1976, ISBN 0-85224-308-1 - Matti Linna:

On omega-sets Associated with Context-Free Languages. ICALP 1976: 1-19 - Eljas Soisalon-Soininen, Esko Ukkonen:

A Characterization of LL(k) Languages. ICALP 1976: 20-30 - Leslie G. Valiant:

The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets. ICALP 1976: 31-37 - Antonio Restivo:

On a Family of Codes Related to Factorization of Cyclotomic Polynomials. ICALP 1976: 38-44 - Dominique Perrin:

Sur la longeur moyenne des codes préfixes. ICALP 1976: 45-51 - Jacques Sakarovitch:

Sur les monoïdes syntactiques des langages algébriques déterministes. ICALP 1976: 52-65 - Joffroy Beauquier:

Générateurs algébriques non-ambigus. ICALP 1976: 66-73 - André Arnold, Max Dauchet:

Bi-transductions de forêts. ICALP 1976: 74-86 - Fred Kröger:

Logical Rules of Natural Reasoning about Programs. ICALP 1976: 87-98 - Maarten H. van Emden:

Verification Conditions as Programs. ICALP 1976: 99-119 - Witold Lipski Jr.:

Informational Systems with Incomplete Information. ICALP 1976: 120-130 - J. Schwarz:

Event Based Reasoning - A System for Proving Correct Termination of Programs. ICALP 1976: 131-146 - Giuseppe Longo, Marisa Venturini Zilli:

A Theory of Computation with an Identity Discriminator. ICALP 1976: 147-167 - Gérard Berry, Bruno Courcelle:

Program Equivalence and Canonical Forms in Stable Discrete Interpretations. ICALP 1976: 168-188 - Irène Guessarian:

Semantic Equivalence of Program Schemes and its Syntactic Characterization. ICALP 1976: 189-200 - Daniel Brand:

Proving Programs Incorrect. ICALP 1976: 201-227 - Robert Cartwright:

User-Defined Data Types as an Aid to Verifying LISP Programs. ICALP 1976: 228-256 - Daniel P. Friedman, David S. Wise:

CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284 - John Gill, István Simon:

Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures. ICALP 1976: 285-306 - William F. McColl:

The Depth of Boolean Functions. ICALP 1976: 307-321 - Claus-Peter Schnorr:

Optimal Algorithms for Self-Reducible Problems. ICALP 1976: 322-337 - Helmut Alt, Kurt Mehlhorn:

Lower Bounds for the Space Complexity of Context-Free Recognition. ICALP 1976: 338-354 - Zvi Galil:

On Enumeration Procedures for Theorem Proving and for Integer Programming. ICALP 1976: 355-381 - Jan van Leeuwen:

On the Construction of Huffman Trees. ICALP 1976: 382-410 - Max Fontet:

A Linear Algorithm for Testing Isomorphism of Planar Graphs. ICALP 1976: 411-424 - Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer:

A Note on the Average Time to Compute Transitive Closures. ICALP 1976: 425-434 - J. W. de Bakker:

Semantics and Termination of Nondeterministic Recursive Programs. ICALP 1976: 435-477 - Matthew Hennessy, Edward A. Ashcroft:

The Semantics of Nondeterminism. ICALP 1976: 478-493 - Irene Greif:

On Proofs of Programs for Synchronization. ICALP 1976: 494-507 - Hans-Dieter Ehrich:

Outline of an Algebraic Theory of Structured Objects. ICALP 1976: 508-530 - Michel Sintzoff:

Eliminating Blind Alleys from Backtrack Programs. ICALP 1976: 531-557

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













