Ronald V. Book Hauptvortrag: Formal language theory and theoretical computer science. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:1-15 [Conf]
Kurt Mehlhorn Best possible bounds for the weighted path length of optimum binary search trees. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:31-41 [Conf]
P. H. Fuchs Statistical characterization of learnable sequences. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:52-56 [Conf]
Herbert Kopp Über den mittleren Zeitbedarf bei der LR(k)-Analyse kontextfreier Sprachen. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:57-63 [Conf]
Rüdiger Valk Zur endlichen Approximierbarkeit sequentieller Systeme. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:64-70 [Conf]
Michael J. Fischer Hauptvortrag: The complexity of negation-limited networks - A brief survey. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:71-82 [Conf]
Claus-Peter Schnorr The network-complexity of equivalence and other applications of the network complexity. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:83-92 [Conf]
Max Fontet Test d'isomorphie d'hypergraphes planaires. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:93-98 [Conf]
Hanke Bremer Obere und untere Schranke für die Komplexität von Booleschen Funktionen. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:99-102 [Conf]
Aldo de Luca On the entropy of a formal language. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:103-109 [Conf]
Burkhard Monien About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:118-126 [Conf]
H. Beck Zur Entscheidbarkeit der funktionalen Äquivalenz. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:127-133 [Conf]
George E. Collins Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:134-183 [Conf]
Karl Weiß Deterministische indizierte Grammatiken. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:184-189 [Conf]
Manfred Opp Eine Beschreibung contextfreier Sprachen durch endliche Mengensysteme. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:190-197 [Conf]
Imre Simon Piecewise testable events. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:214-222 [Conf]
Rainer Kemp Die Größe des zustandsminimalen LR(0)-Analysators. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:223-232 [Conf]
Antonio Restivo A characterization of bounded regular sets. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:239-244 [Conf]
Elfriede Fehr Eine universelle Lambda-Kalkül-Programmiersprache und ihr Interpreter. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:245-251 [Conf]
Herbert Klaeren Potenzkaegorien und ihre Anwendung auf den Beweis von Programmeigenschaften. [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:252-258 [Conf]
Hans Langmaack Hauptvortrag: Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik? [Citation Graph (0, 0)][DBLP] Automata Theory and Formal Languages, 1975, pp:259-273 [Conf]
