Arto Salomaa, Magnus Steinby
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
ICALP, 1977.

@proceedings{ICALP-1977,
	address       = "University of Turku, Finland",
	editor        = "Arto Salomaa and Magnus Steinby",
	isbn          = "3-540-08342-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth Colloquium on Automata, Languages and Programming}",
	volume        = 52,
	year          = 1977,
}

Contents (43 items)

9 ×#on the
7 ×#problem
4 ×#complexity
3 ×#context-free grammar
3 ×#finite
3 ×#parsing
2 ×#bound
2 ×#composition
2 ×#data type
2 ×#decidability

ICALP-1977-AhoS #code generation #compilation #how #question

How Hard is Compiler Code Generation? (AVA, RS), pp. 1–15.

ICALP-1977-Alton #complexity #memory management #metric

“Natural” Complexity Measures and Time versus Memory: Some Definitional Proposals (DAA), pp. 16–29.

ICALP-1977-AptB #pascal #proving #semantics

Semantics and Proof Theory of Pascal Procedures (KRA, JWdB), pp. 30–44.

ICALP-1977-AusielloDP #combinator #on the #problem #reduction

On the Structure of Combinatorial Problems and Structure Preserving Reductions (GA, AD, MP), pp. 45–60.

ICALP-1977-BackhouseL #graph

Factor Graphs, Failure Functions and BI-Trees (RCB, RKL), pp. 61–75.

ICALP-1977-BensonJ #composition #lr #parallel #parsing

Parallel Decomposition of LR(k) Parsers (DBB, RDJ), pp. 76–86.

ICALP-1977-BertoniMT #automaton #probability #problem #recursion

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.

ICALP-1977-BohmCD #termination #testing #λ-calculus

Termination Tests inside λ-Calculus (CB, MC, MDC), pp. 95–110.

ICALP-1977-BookY #bound #on the #power of

On the Computational Power of Reversal-Bounded Machines (RVB, CKY), pp. 111–119.

ICALP-1977-Brandenburg #bound #context-sensitive grammar

The Contextsensitivity Bounds of Contextsensitive Grammars and Languages (FJB), pp. 120–134.

ICALP-1977-ChytilJ #composition #finite #source code #string #transducer

Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.

ICALP-1977-CulikF #decidability #equivalence #problem #sequence

The Sequence Equivalence Problem for D0L Systems is Decidable (KCI, IF), pp. 148–163.

ICALP-1977-Damm

Languages Defined by Higher Type Program Schemes (WD), pp. 164–179.

ICALP-1977-Dieterich #context-free grammar #fault #parsing

Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures (EWD), pp. 180–192.

ICALP-1977-DikovskyM #ambiguity #context-free grammar #on the

On Three Types of Unambiguity of Context-Free Languages (AJD, LSM), pp. 193–205.

ICALP-1977-EhrigR

The Mathematics of Record Handling (HE, BKR), pp. 206–220.

ICALP-1977-Engelfriet #metaprogramming

Macro Grammars, Lindenmayer Systems and Other Copying Devices (JE), pp. 221–229.

ICALP-1977-Erni #complexity #on the

On the Time and Tape Complexity of Hyper(1)-AFL’s (WJE), pp. 230–243.

ICALP-1977-HopnerO

Renaming and Erasing in Szilard Languages (MH, MO), pp. 244–257.

ICALP-1977-ItaiR #problem

Some Matching Problems (AI, MR), pp. 258–268.

ICALP-1977-Jacob #french #matrix

Complexite des Demi-Groupes de Matrices (GJ), pp. 269–281.

ICALP-1977-JanssenB #on the

On the Proper Treatment or Referencing, Dereferencing and Assignment (TMVJ, PvEB), pp. 282–300.

ICALP-1977-JonesS #complexity #problem

Complexity of Some Problems Concerning L Systems (NDJ, SS), pp. 301–308.

ICALP-1977-KriegelO

Left-Fitting Translations (HPK, TO), pp. 309–322.

ICALP-1977-Mehlhorn

Dynamic Binary Search (KM), pp. 323–336.

ICALP-1977-Monien

About the Derivation Languages of Grammars and Machines (BM), pp. 337–351.

ICALP-1977-Nijholt

Simple Chain Grammars (AN), pp. 352–364.

ICALP-1977-PaulT #game studies #trade-off

Time-Space Trade-Offs in a Pebble Game (WJP, RET), pp. 365–369.

ICALP-1977-PazM #approximate #nondeterminism #optimisation #polynomial #problem

Non-Deterministic Polynomial Optimization Problems and Their Approximation (AP, SM), pp. 370–379.

ICALP-1977-PnueliS #problem #source code

Simple Programs and Their Decision Problems (AP, GS), pp. 380–390.

ICALP-1977-Rajlich #data type #graph grammar #relational

Theory of Data Structures by Relational and Graph Grammars (VR), pp. 391–411.

ICALP-1977-Roever #backtracking #fixpoint #on the

On Backtracking and Greatest Fixpoints (WPdR), pp. 412–429.

ICALP-1977-RozenbergV #finite

L Systems of Finite Index (GR, DV), pp. 430–439.

ICALP-1977-Sajaniemi #safety

The Safety of a Coroutine System (JS), pp. 440–452.

ICALP-1977-SavitchV #linear #multi #simulation #turing machine

Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps (WJS, PMBV), pp. 453–464.

ICALP-1977-ShamirW #data type

Data Types as Objects (AS, WWW), pp. 465–479.

ICALP-1977-Simon #difference #on the

On the Difference Between One and Many (JS), pp. 480–491.

ICALP-1977-SippuS #fault #on the #parsing

On Defining Error Recovery in Context-Free Parsing (SS, ESS), pp. 492–503.

ICALP-1977-Streinu #finite #ll

LL(k) Languages are Closed Under Union with Finite Languages (IS), pp. 504–508.

ICALP-1977-Sudborough #complexity

The Time and Tape Complexity of Developmental Languages (IHS), pp. 509–523.

ICALP-1977-Takahashi

Rational relations of Binary Trees (MT), pp. 524–538.

ICALP-1977-Walter #context-free grammar #decidability #equivalence

Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.

ICALP-1977-Courcelle #on the

On the Definition of Classes of Interpretations (BC), pp. 554–569.