The SCEAS System
Navigation Menu

Conferences in DBLP

Automata Theory and Formal Languages / Automatentheorie und Formale Sprachen (automata)
1975 (conf/automata/1975)

  1. 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]
  2. Luc Boasson, Maurice Nivat
    Le cylindre des langages linéaires n'est pas principal. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:16-19 [Conf]
  3. Jean-François Perrot, Jacques Sakarovitch
    Langages algébriques déterministes et groupes abeliens. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:20-30 [Conf]
  4. 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]
  5. Jürgen Avenhaus, Klaus Madlener
    En\En-1-entscheidbare Gruppen. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:42-51 [Conf]
  6. P. H. Fuchs
    Statistical characterization of learnable sequences. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:52-56 [Conf]
  7. 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]
  8. Rüdiger Valk
    Zur endlichen Approximierbarkeit sequentieller Systeme. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:64-70 [Conf]
  9. 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]
  10. 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]
  11. Max Fontet
    Test d'isomorphie d'hypergraphes planaires. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:93-98 [Conf]
  12. 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]
  13. 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]
  14. David P. Dobkin, Richard J. Lipton
    On the complexity of computations under varying sets of primitives. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:110-117 [Conf]
  15. 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]
  16. H. Beck
    Zur Entscheidbarkeit der funktionalen Äquivalenz. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:127-133 [Conf]
  17. 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]
  18. Karl Weiß
    Deterministische indizierte Grammatiken. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:184-189 [Conf]
  19. Manfred Opp
    Eine Beschreibung contextfreier Sprachen durch endliche Mengensysteme. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:190-197 [Conf]
  20. Sorin Ciobotaru, Gheorghe Paun
    On the generative capacity of the strict global grammars. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:198-201 [Conf]
  21. Peter Paul Schreiber
    Tree-transducers and syntax-connected transductions. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:202-208 [Conf]
  22. Marcel Paul Schützenberger
    Sur les relations rationnelles. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:209-213 [Conf]
  23. Imre Simon
    Piecewise testable events. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:214-222 [Conf]
  24. 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]
  25. Hans-Peter Kriegel, Hermann A. Maurer
    Formal translations and the containment problem for Szilard languages. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:233-238 [Conf]
  26. Antonio Restivo
    A characterization of bounded regular sets. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:239-244 [Conf]
  27. 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]
  28. 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]
  29. 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]
  30. Wolfgang Bibel
    Prädikatives Programmieren. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:274-283 [Conf]
  31. Eberhard Bertsch
    Analyzing families of grammars. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:284-288 [Conf]
  32. Klaus Indermark
    Control structures and monadic languages. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:289-292 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002