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	Hilfe

Suche: Series=LNCS AND Volume=45

• Exercises in denotational semantics
  K.R. Apt, J.W. de Bakker
  Lecture Notes in Computer Science 45, 1976, pp. 1-11
• W-automata and their languages
  Wilfried Brauer
  Lecture Notes in Computer Science 45, 1976, pp. 12-22
• On semantic issues in the relational model of data
  J.-M. Cadiou
  Lecture Notes in Computer Science 45, 1976, pp. 23-38
• The effective arrangement of logical systems
  Edsger W. Dijkstra
  Lecture Notes in Computer Science 45, 1976, pp. 39-51
• Recursivity, sequence recursivity, stack recursivity and semantics of programs
  G. Germano, A. Maggiolo-Schettini
  Lecture Notes in Computer Science 45, 1976, pp. 52-64
• Descriptional complexity (of languages) - A short survey
  Jozef Gruska
  Lecture Notes in Computer Science 45, 1976, pp. 65-80
• On the branching structure of languages
  Ivan M. Havel
  Lecture Notes in Computer Science 45, 1976, pp. 81-98
• Algorithms and real numbers
  N.M. Nagorny
  Lecture Notes in Computer Science 45, 1976, pp. 99-104
• On mappings of machines
  Miroslav Novotný
  Lecture Notes in Computer Science 45, 1976, pp. 105-114
• Recent results on L systems
  Arto Salomaa
  Lecture Notes in Computer Science 45, 1976, pp. 115-123
• Decision problems for multi-tape automata
  Peter H. Starke
  Lecture Notes in Computer Science 45, 1976, pp. 124-136
• Recursive program schemes and computable functionals
  B.A. Trakhtenbrot
  Lecture Notes in Computer Science 45, 1976, pp. 137-152
• Some fundamentals of order-algebraic semantics
  E.G. Wagner, J.B. Wright, J.A. Goguen, J.W. Thatcher
  Lecture Notes in Computer Science 45, 1976, pp. 153-168
• On attribute grammars
  V.N. Agafonov
  Lecture Notes in Computer Science 45, 1976, pp. 169-172
• Formal definition of semantics of generalized control regimes
  L. Aiello, M. Aiello, G. Attardi, P. Cavallari, G. Prini
  Lecture Notes in Computer Science 45, 1976, pp. 173-179
• Minimal While programs
  E.S. Bainbridge
  Lecture Notes in Computer Science 45, 1976, pp. 180-186
• On specific features of recognizable families of languages
  Václav Benda, Kamila Bendová
  Lecture Notes in Computer Science 45, 1976, pp. 187-193
• On the termination of simple computer programs
  Eberhard Bergmann
  Lecture Notes in Computer Science 45, 1976, pp. 194-201
• Reduction of Petri-nets
  G. Berthelot, G. Roucairol
  Lecture Notes in Computer Science 45, 1976, pp. 202-209
• On behaviour of R-fuzzy automata
  Jürgen Brunner, Wolfgang Wechler
  Lecture Notes in Computer Science 45, 1976, pp. 210-215
• Cannonizing reducibility method in the theory of program schemata
  A.O. Buda
  Lecture Notes in Computer Science 45, 1976, pp. 216-223
• Strongly connected G-S-M mappings preserving conjugation
  C. Choffrut
  Lecture Notes in Computer Science 45, 1976, pp. 224-229
• Analysis of the non-context-free component of formal languages
  Michal P. Chytil
  Lecture Notes in Computer Science 45, 1976, pp. 230-236
• Programs, computations and temporal features
  Marco Colombetti, Enrico Pagello
  Lecture Notes in Computer Science 45, 1976, pp. 237-243
• A note on the automatic generation of inductive assertions
  Wolfgang Coy
  Lecture Notes in Computer Science 45, 1976, pp. 244-249