Proceedings of the Sixth Colloquium on Automata, Languages and Programming
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Hermann A. Maurer
Proceedings of the Sixth Colloquium on Automata, Languages and Programming
ICALP, 1979.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{ICALP-1979,
	address       = "Graz, Austria",
	editor        = "Hermann A. Maurer",
	isbn          = "3-540-09510-1",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Sixth Colloquium on Automata, Languages and Programming}",
	volume        = 71,
	year          = 1979,
}

Contents (53 items)

ICALP-1979-AstesianoC #nondeterminism
Sharing in Nondeterminism (EA, GC), pp. 1–15.
ICALP-1979-Berstel #french #morphism
Sur les mots sans carré définis par un morphisme (JB), pp. 16–25.
ICALP-1979-BertoniMM #invariant
A Characterization of Abstract Data as Model-Theoretic Invariants (AB, GM, PM), pp. 26–37.
ICALP-1979-Blattner #product line
Inherent Ambiguities in Families of Grammars (MB), pp. 38–48.
ICALP-1979-BookB #complexity #representation #set #similarity
Representing Complexity Classes by Equality Sets (RVB, FJB), pp. 49–57.
ICALP-1979-BraunmuhlH
Supercounter Machines (BvB, EH), pp. 58–72.
ICALP-1979-BroyDPPW #data type #quantifier
Existential Quantifiers in Abstract Data Types (MB, WD, HP, PP, MW), pp. 73–87.
ICALP-1979-Choffrut
A Generalization of Ginsburg and Rose’s Characterization of G-S-M Mappings (CC), pp. 88–103.
ICALP-1979-Chottin #strict #term rewriting
Strict Deterministic Languages and Controlled Rewriting Systems (LC), pp. 104–117.
ICALP-1979-Commentz-Walter #algorithm #performance #string
A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.
ICALP-1979-CoppoDS #functional #semantics #λ-calculus
Functional Characterization of Some Semantic Equalities inside λ-Calculus (MC, MDC, PS), pp. 133–146.
ICALP-1979-CremersH #requirements
Arbitration and Queuing Under Limited Shared Storage Requirements (ABC, TNH), pp. 147–160.
ICALP-1979-Culik #on the #product line
On the Homomorphic Characterizations of Families of Languages (KCI), pp. 161–170.
ICALP-1979-DembinskiM #equation #two-level grammar
Two Level Grammars: CF-Grammars with Equation Schemes (PD, JM), pp. 171–187.
ICALP-1979-DershowitzM #multi #order #proving #termination
Proving termination with Multiset Orderings (ND, ZM), pp. 188–202.
ICALP-1979-Deussen #algorithm #parsing
One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.
ICALP-1979-DuncanY #algorithm #correctness #proving
Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness (AGD, LY), pp. 218–229.
ICALP-1979-FichB
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages (FEF, JAB), pp. 230–244.
ICALP-1979-Friede #ll
Partitioned LL(k) Grammars (DF), pp. 245–255.
ICALP-1979-Gallier #recursion
Recursion Schemes and Generalized Interpretations (JHG), pp. 256–270.
ICALP-1979-Goldstine
A Rational Theory of AFLS (JG), pp. 271–281.
ICALP-1979-Hartmanis #on the
On the Succintness of Different Representations of Languages (JH), pp. 282–288.
ICALP-1979-Istrail #fixpoint #monad #recursion #semantics #source code #theorem
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.
ICALP-1979-Janko
Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons (WJ), pp. 304–315.
ICALP-1979-Jeanrond #axiom #commutative #termination #theorem
A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.
ICALP-1979-KamimuraS #graph
DAGs and Chomsky Hierarchy (TK, GS), pp. 331–337.
ICALP-1979-Karp #algorithm #analysis #graph #probability
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (RMK), pp. 338–339.
ICALP-1979-Kemp #distributed #on the #stack
On the Average Stack Size of Regularly Distributed Binary Trees (RK), pp. 340–355.
ICALP-1979-KowalkV #on the #parallel #reduction #source code
On Reductions of Parallel Programs (WK, RV), pp. 356–369.
ICALP-1979-KuichPU #on the
On the Height of Derivation Trees (WK, HP, FJU), pp. 370–384.
ICALP-1979-MannaP #logic #source code
The Modal Logic of Programs (ZM, AP), pp. 385–409.
ICALP-1979-Heide #comparison #game studies #graph
A Comparison Between Two Variations of a Pebble Game on Graphs (FMadH), pp. 411–421.
ICALP-1979-MiltonF #attribute grammar #ll #parsing
LL(k) Parsing for Attributed Grammars (DRM, CNF), pp. 422–430.
ICALP-1979-MonienS #nondeterminism #on the #turing machine
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.
ICALP-1979-Nijholt #recursion
Structure Preserving Transformations on Non-Left-Recursive Grammars (AN), pp. 446–459.
ICALP-1979-PapadimitriouY #complexity #problem #strict
The Complexity of Restricted Minimum Spanning Tree Problems (CHP, MY), pp. 460–470.
ICALP-1979-Rozenberg #approach #formal method #parallel
A Systematic Approach to Formal Language Theory Through Parallel Rewriting (GR), pp. 471–478.
ICALP-1979-RozenbergV #finite
Extending the Notion of Finite Index (GR, DV), pp. 479–488.
ICALP-1979-Ruzzo #complexity #context-free grammar #on the #parsing #recognition
On the Complexity of General Context-Free Language Parsing and Recognition (WLR), pp. 489–497.
ICALP-1979-SavageS #integer #multi #trade-off
Space-Time Tradeoffs for Oblivious Integer Multiplications (JES, SS), pp. 498–504.
ICALP-1979-Schmidt #graph #source code
Investigating Programs in Terms of Partial Graphs (GS), pp. 505–519.
ICALP-1979-Schonhage #on the #power of #random
On the Power of Random Access Machines (AS), pp. 520–529.
ICALP-1979-Schwartz #algol #axiom
An Axiomatic Treatment of Algol 68 Routines (RLS), pp. 530–545.
ICALP-1979-Selman #behaviour #polynomial #set
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP (ALS), pp. 546–555.
ICALP-1979-SethiT #call-by #continuation #semantics
Constructing Call-by-Value Continuation Semantics (RS, AT), pp. 556–570.
ICALP-1979-ShieldsL #concurrent #semantics
A Formal Semantics for Concurrent Systems (MWS, PEL), pp. 571–584.
ICALP-1979-SippuS #ll #on the #parsing
On Constructing LL(k) Parsers (SS, ESS), pp. 585–595.
ICALP-1979-ThatcherWW #compilation #proving
More on Advice on Structuring Compilers and Proving Them Correct (JWT, EGW, JBW), pp. 596–615.
ICALP-1979-Therien
Languages of Nilpotent and Solvable Groups (DT), pp. 616–632.
ICALP-1979-Tiuryn #fixpoint
Unique Fixed Points vs. Least Fixed Points (JT), pp. 633–645.
ICALP-1979-Ukkonen #bottom-up #lr #parsing
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers (EU), pp. 646–658.
ICALP-1979-Ury #automaton #composition #linear
Optimal Decomposition of Linear Automata (), pp. 659–667.
ICALP-1979-Wegner #approach #decidability #two-level grammar
Bracketed Two-Level Grammars — A Decidable and Practical Approach to Language Definitions (LMW), pp. 668–682.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.