default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd Automata Theory and Formal Languages 1975: Kaiserslautern, Germany
- H. Barkhage:
Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975. Lecture Notes in Computer Science 33, Springer 1975, ISBN 3-540-07407-4
Dienstagvormittag
- Ronald V. Book:
Hauptvortrag: Formal language theory and theoretical computer science. 1-15 - Luc Boasson, Maurice Nivat:
Le cylindre des langages linéaires n'est pas principal. 16-19 - Jean-François Perrot, Jacques Sakarovitch:
Langages algébriques déterministes et groupes abeliens. 20-30
Dienstagnachmittag
- Kurt Mehlhorn:
Best possible bounds for the weighted path length of optimum binary search trees. 31-41 - Jürgen Avenhaus, Klaus Madlener:
En\En-1-entscheidbare Gruppen. 42-51 - P. H. Fuchs:
Statistical characterization of learnable sequences. 52-56 - Herbert Kopp:
Über den mittleren Zeitbedarf bei der LR(k)-Analyse kontextfreier Sprachen. 57-63 - Rüdiger Valk:
Zur endlichen Approximierbarkeit sequentieller Systeme. 64-70
Mittwochvormittag
- Michael J. Fischer:
Hauptvortrag: The complexity of negation-limited networks - A brief survey. 71-82 - Claus-Peter Schnorr:
The network-complexity of equivalence and other applications of the network complexity. 83-92 - Max Fontet:
Test d'isomorphie d'hypergraphes planaires. 93-98 - Hanke Bremer:
Obere und untere Schranke für die Komplexität von Booleschen Funktionen. 99-102 - Aldo de Luca:
On the entropy of a formal language. 103-109
Mittwochnachmittag
- David P. Dobkin, Richard J. Lipton:
On the complexity of computations under varying sets of primitives. 110-117 - Burkhard Monien:
About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. 118-126 - Heinrich Beck:
Zur Entscheidbarkeit der funktionalen Äquivalenz. 127-133
Donnerstagvormittag
- George E. Collins:
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. 134-183 - Karl Weiß:
Deterministische indizierte Grammatiken. 184-189 - Manfred Opp:
Eine Beschreibung contextfreier Sprachen durch endliche Mengensysteme. 190-197 - Sorin Ciobotaru, Gheorghe Paun:
On the generative capacity of the strict global grammars. 198-201 - Peter Paul Schreiber:
Tree-transducers and syntax-connected transductions. 202-208 - Marcel Paul Schützenberger:
Sur les relations rationnelles. 209-213
Donnerstagnachmittag
- Imre Simon:
Piecewise testable events. 214-222 - Rainer Kemp:
Die Größe des zustandsminimalen LR(0)-Analysators. 223-232 - Hans-Peter Kriegel, Hermann A. Maurer:
Formal translations and the containment problem for Szilard languages. 233-238 - Antonio Restivo:
A characterization of bounded regular sets. 239-244 - Elfriede Fehr:
Eine universelle Lambda-Kalkül-Programmiersprache und ihr Interpreter. 245-251 - Herbert Klaeren:
Potenzkaegorien und ihre Anwendung auf den Beweis von Programmeigenschaften. 252-258
Freitagvormittag
- Hans Langmaack:
Hauptvortrag: Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik? 259-273 - Wolfgang Bibel:
Prädikatives Programmieren. 274-283 - Eberhard Bertsch:
Analyzing families of grammars. 284-288 - Klaus Indermark:
Control structures and monadic languages. 289-292
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.
last updated on 2025-12-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
