Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [5]	Hilfe

Suche: Series=LNCS AND Volume=32

• An algebraic theory of formal languages
  Raymond Turner
  Lecture Notes in Computer Science 32, 1975, pp. 426-431
• On polynomial reducibility of word problem under embedding of recursively presented groups in finitely presented groups
  M.K. Valiev
  Lecture Notes in Computer Science 32, 1975, pp. 432-438
• On the synthesis of automata with several initial states
  Rüdiger Valk
  Lecture Notes in Computer Science 32, 1975, pp. 439-444
• A hierarchy of regular sequence sets
  Klaus Wagner
  Lecture Notes in Computer Science 32, 1975, pp. 445-449
• R-fuzzy grammars
  Wolfgang Wechler
  Lecture Notes in Computer Science 32, 1975, pp. 450-456
• Characterization of some classes of context-free languages in terms of complexity classes
  Gerd Wechsung
  Lecture Notes in Computer Science 32, 1975, pp. 457-461
• Inductive inference of recursive functions
  Rolf Wiehagen
  Lecture Notes in Computer Science 32, 1975, pp. 462-464
• Proving properties of programs by means of predicate logic
  Józef Winkowski
  Lecture Notes in Computer Science 32, 1975, pp. 465-471
• A generalization of Scott's flow diagrams
  Bolesƚaw Wojdyƚo
  Lecture Notes in Computer Science 32, 1975, pp. 472-476