Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540074076, 9783540379232

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A characterization of bounded regular sets

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_26 ◽

1975 ◽

pp. 239-244 ◽

Author(s):

Antonio Restivo

Keyword(s):

Download Full-text

Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_29 ◽

1975 ◽

pp. 259-273

Author(s):

Hans Langmaack

Download Full-text

Deterministische indizierte Grammatiken

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_18 ◽

1975 ◽

pp. 184-189

Author(s):

Karl Weiß

Download Full-text

Analyzing families of grammars

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_31 ◽

1975 ◽

pp. 284-288 ◽

Author(s):

Eberhard Bertsch

Download Full-text

On the complexity of computations under varying sets of primitives

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_14 ◽

1975 ◽

pp. 110-117 ◽

Author(s):

David P. Dobkin ◽

Richard J. Lipton

Download Full-text

Zur endlichen Approximierbarkeit sequentieller Systeme

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_8 ◽

1975 ◽

pp. 64-70

Author(s):

Rüdiger Valk

Download Full-text

Piecewise testable events

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_23 ◽

1975 ◽

pp. 214-222 ◽

Author(s):

Imre Simon

Download Full-text

Formal translations and the containment problem for Szilard languages

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_25 ◽

1975 ◽

pp. 233-238

Author(s):

H. P. Kriegel ◽

H. A. Maurer

Keyword(s):

Containment Problem

Download Full-text

Über den mittleren Zeitbedarf bei der LR(k) — Analyse kontextfreier Sprachen

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_7 ◽

1975 ◽

pp. 57-63

Author(s):

Herbert Kopp

Download Full-text

Potenzkategorien und ihre Anwendung auf den Beweis von Programmeigenschaften

Lecture Notes in Computer Science - Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975 ◽

10.1007/3-540-07407-4_28 ◽

1975 ◽

pp. 252-258 ◽

Author(s):

Herbert A. Klaeren

Download Full-text