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=267

• Recent developments in the theory of learning
  L.G. Valiant
  Lecture Notes in Computer Science 267, 1987, pp. 563
• Probability and plurality for aggregations of learning machines
  L. Pitt, C.H. Smith
  Lecture Notes in Computer Science 267, 1987, pp. 1-10
• Logic programming with ions
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 267, 1987, pp. 11-20
• Inverse image analysis
  P. Dybjer
  Lecture Notes in Computer Science 267, 1987, pp. 21-30
• A unification algorithm for confluent theories
  S. Hölldobler
  Lecture Notes in Computer Science 267, 1987, pp. 31-41
• On the Knuth-Bendix completion for concurrent processes
  V. Diekert
  Lecture Notes in Computer Science 267, 1987, pp. 42-53
• On word problems in equational theories
  J. Hsiang, M. Rusinowitch
  Lecture Notes in Computer Science 267, 1987, pp. 54-71
• Semantics for nondeterministic asynchronous broadcast networks
  R.K. Shyamasundar, K.T. Narayana, T. Pitassi
  Lecture Notes in Computer Science 267, 1987, pp. 72-83
• Another look at abstraction in process algebra
  J.C.M. Baeten, R.J. van Glabbeek
  Lecture Notes in Computer Science 267, 1987, pp. 84-94
• A timed failures model for extended communicating processes
  R. Gerth, A. Boucher
  Lecture Notes in Computer Science 267, 1987, pp. 95-114
• Readiness semantics for regular processes with silent actions
  S. Graf, J. Sifakis
  Lecture Notes in Computer Science 267, 1987, pp. 115-125
• Verifying a protocol using relativized bisimulation
  K.G. Larsen, R. Milner
  Lecture Notes in Computer Science 267, 1987, pp. 126-135
• On recent trends in formal language theory
  J. Karhumäki
  Lecture Notes in Computer Science 267, 1987, pp. 136-162
• Non-uniform automata over groups
  D.A. Barrington, D. Thérien
  Lecture Notes in Computer Science 267, 1987, pp. 163-173
• Minimal automaton of a rational cover
  D. Beauquier
  Lecture Notes in Computer Science 267, 1987, pp. 174-189
• A star-height problem in free monoids with partial commutations
  C. Choffrut, C. Duboc
  Lecture Notes in Computer Science 267, 1987, pp. 190-201
• Single-valued finite transduction
  J.H. Johnson
  Lecture Notes in Computer Science 267, 1987, pp. 202-211
• The Kleene and the Parikh theorem in complete semirings
  W. Kuich
  Lecture Notes in Computer Science 267, 1987, pp. 212-225
• An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
  Y. Métivier
  Lecture Notes in Computer Science 267, 1987, pp. 226-236
• On the languages accepted by finite reversible automata
  J.E. Pin
  Lecture Notes in Computer Science 267, 1987, pp. 237-249
• Decision problems for regular trace languages
  I.J. Aalbersberg, H.J. Hoogeboom
  Lecture Notes in Computer Science 267, 1987, pp. 250-259
• Panic mode without panic
  M.P. Chytil, J. Demner
  Lecture Notes in Computer Science 267, 1987, pp. 260-268
• Computation tree logic CTL^* and path quantifiers in the monadic theory of the binary tree
  T. Hafer, W. Thomas
  Lecture Notes in Computer Science 267, 1987, pp. 269-279
• Modelchecking of CTL formulae under liveness assumptions
  B. Josko
  Lecture Notes in Computer Science 267, 1987, pp. 280-289
• A modal logic for a subclass of event structures
  K. Lodaya, P.S. Thiagarajan
  Lecture Notes in Computer Science 267, 1987, pp. 290-303