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

• Two lower bounds on computational complexity of infinite words
  Juraj Hromkovic̑, Juhani Karhumäki
  Lecture Notes in Computer Science 1218, 1997, pp. 366-376
• On \omega-power languages
  Ludwig Staiger
  Lecture Notes in Computer Science 1218, 1997, pp. 377-394
• Shuffle-like operations on \omega-words
  Alaxandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa
  Lecture Notes in Computer Science 1218, 1997, pp. 395-411
• Generalized Lindenmayerian algebraic systems
  Werner Kuich
  Lecture Notes in Computer Science 1218, 1997, pp. 412-421
• The structure of the basic morphisms
  Virgil Emil Căzănescu
  Lecture Notes in Computer Science 1218, 1997, pp. 422-429
• On mix operation
  Manfred Kudlek, Alexandru Mateescu
  Lecture Notes in Computer Science 1218, 1997, pp. 430-439
• On the complexity of iterated insertions
  Markus Holzer, Klaus-Jörn Lange
  Lecture Notes in Computer Science 1218, 1997, pp. 440-453
• The decidability of the generalized confluence problem for context-free languages
  Lucian Ilie
  Lecture Notes in Computer Science 1218, 1997, pp. 454-464