6. ICALP 1979:
Graz,
Austria
Hermann A. Maurer (Ed.):
Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings.
Lecture Notes in Computer Science 71 Springer 1979, ISBN 3-540-09510-1 BibTeX
@proceedings{DBLP:conf/icalp/1979,
editor = {Hermann A. Maurer},
title = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
July 16-20, 1979, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {71},
year = {1979},
isbn = {3-540-09510-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Egidio Astesiano, Gerardo Costa:
Sharing in Nondeterminism.
1-15 BibTeX
- Jean Berstel:
Sur les mots sans carré définis par un morphisme.
16-25 BibTeX
- Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli:
A Characterization of Abstract Data as Model-Theoretic Invariants.
26-37 BibTeX
- Meera Blattner:
Inherent Ambiguities in Families of Grammars (Extended Abstract).
38-48 BibTeX
- Ronald V. Book, Franz-Josef Brandenburg:
Representing Complexity Classes by Equality Sets (Preliminary Report).
49-57 BibTeX
- Burchard von Braunmühl, Eckehart Hotzel:
Supercounter Machines.
58-72 BibTeX
- Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing:
Existential Quantifiers in Abstract Data Types.
73-87 BibTeX
- Christian Choffrut:
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings.
88-103 BibTeX
- Laurent Chottin:
Strict Deterministic Languages and Controlled Rewriting Systems.
104-117 BibTeX
- Beate Commentz-Walter:
A String Matching Algorithm Fast on the Average.
118-132 BibTeX
- Mario Coppo, Mariangiola Dezani-Ciancaglini, Patrick Sallé:
Functional Characterization of Some Semantic Equalities inside Lambda-Calculus.
133-146 BibTeX
- Armin B. Cremers, Thomas N. Hibbard:
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report).
147-160 BibTeX
- Karel Culik II:
On the Homomorphic Characterizations of Families of Languages.
161-170 BibTeX
- Piotr Dembinski, Jan Maluszynski:
Two Level Grammars: CF-Grammars with Equation Schemes.
171-187 BibTeX
- Nachum Dershowitz, Zohar Manna:
Proving termination with Multiset Orderings.
188-202 BibTeX
- Peter Deussen:
One Abstract Accepting Algorithm for all Kinds of Parsers.
203-217 BibTeX
- Arthur G. Duncan, Lawrence Yelowitz:
Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness.
218-229 BibTeX
- Faith E. Fich, Janusz A. Brzozowski:
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages.
230-244 BibTeX
- Dietmar Friede:
Partitioned LL(k) Grammars.
245-255 BibTeX
- Jean H. Gallier:
Recursion Schemes and Generalized Interpretations (Extended Abstract).
256-270 BibTeX
- Jonathan Goldstine:
A Rational Theory of AFLS.
271-281 BibTeX
- Juris Hartmanis:
On the Succintness of Different Representations of Languages.
282-288 BibTeX
- Sorin Istrail:
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs.
289-303 BibTeX
- Wolfgang Janko:
Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons.
304-315 BibTeX
- Hans-Josef Jeanrond:
A Unique Termination Theorem for a Theory with Generalised Commutative Axioms.
316-330 BibTeX
- Tsutomu Kamimura, Giora Slutzki:
DAGs and Chomsky Hierarchy (Extended Abstract).
331-337 BibTeX
- Richard M. Karp:
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract).
338-339 BibTeX
- Rainer Kemp:
On the Average Stack Size of Regularly Distributed Binary Trees.
340-355 BibTeX
- Wolfgang Kowalk, Rüdiger Valk:
On Reductions of Parallel Programs.
356-369 BibTeX
- Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek:
On the Height of Derivation Trees.
370-384 BibTeX
- Zohar Manna, Amir Pnueli:
The Modal Logic of Programs.
385-409 BibTeX
- Friedhelm Meyer auf der Heide:
A Comparison Between Two Variations of a Pebble Game on Graphs.
411-421 BibTeX
- D. R. Milton, Charles N. Fischer:
LL(k) Parsing for Attributed Grammars.
422-430 BibTeX
- Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space.
431-445 BibTeX
- Anton Nijholt:
Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version).
446-459 BibTeX
- Christos H. Papadimitriou, Mihalis Yannakakis:
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract).
460-470 BibTeX
- Grzegorz Rozenberg:
A Systematic Approach to Formal Language Theory Through Parallel Rewriting.
471-478 BibTeX
- Grzegorz Rozenberg, Dirk Vermeir:
Extending the Notion of Finite Index.
479-488 BibTeX
- Walter L. Ruzzo:
On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract).
489-497 BibTeX
- John E. Savage, Sowmitri Swamy:
Space-Time Tradeoffs for Oblivious Interger Multiplications.
498-504 BibTeX
- Gunther Schmidt:
Investigating Programs in Terms of Partial Graphs.
505-519 BibTeX
- Arnold Schönhage:
On the Power of Random Access Machines.
520-529 BibTeX
- Richard L. Schwartz:
An Aximatic Treatment of Algol 68 Routines.
530-545 BibTeX
- Alan L. Selman:
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP.
546-555 BibTeX
- Ravi Sethi, Adrian Tang:
Constructing Call-by-Value Continuation Semantics.
556-570 BibTeX
- M. W. Shields, Peter E. Lauer:
A Formal Semantics for Concurrent Systems.
571-584 BibTeX
- Seppo Sippu, Eljas Soisalon-Soininen:
Con Constructing LL(k) Parsers.
585-595 BibTeX
- James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
More on Advice on Structuring Compilers and Proving Them Correct.
596-615 BibTeX
- Denis Thérien:
Languages of Nilpotent and Solvable Groups (Extended Abstract).
616-632 BibTeX
- Jerzy Tiuryn:
Unique Fixed Points v. Least Fixed Points.
633-645 BibTeX
- Esko Ukkonen:
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers.
646-658 BibTeX
- László Úry:
Optimal Decomposition of Linear Automata.
659-667 BibTeX
- Lutz Michael Wegner:
Bracketed Two-Level Grammars - A Decidable and Practical Approach to Language Definitions.
668-682 BibTeX
Copyright © Sat May 16 23:16:04 2009
by Michael Ley (ley@uni-trier.de)
