Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1337

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The might of formulas and their limits
F.L. Bauer
Lecture Notes in Computer Science 1337, 1997, pp. 1-8
Hardware - software: An equivalence and a contradiction
Heinz Zemanek
Lecture Notes in Computer Science 1337, 1997, pp. 9-19
Defining discipline
Wolfgang Coy
Lecture Notes in Computer Science 1337, 1997, pp. 21-35
Computer science as cultural development
Dirk Siefkes
Lecture Notes in Computer Science 1337, 1997, pp. 37-47
Towards adjusting informatics education to information era
Jozef Gruska, Roland Vollmar
Lecture Notes in Computer Science 1337, 1997, pp. 49-67
Informatics and society: A curriculum for distance education
Herbert Klaeren, Christiane Floyd, Friedrich Diestelmeier
Lecture Notes in Computer Science 1337, 1997, pp. 69-78
Syntactic and semantic aspects of parallelism
Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa
Lecture Notes in Computer Science 1337, 1997, pp. 79-105
Unique fixpoints in complete lattices with applications to formal languages and semantics
Ingbert Kupka
Lecture Notes in Computer Science 1337, 1997, pp. 107-115
On abstract families of languages, power series, and elements
Georg Karner, Werner Kuich
Lecture Notes in Computer Science 1337, 1997, pp. 117-124
Are there formal languages complete for SymSPACE(\log n)?
Klaus-Jörn Lange
Lecture Notes in Computer Science 1337, 1997, pp. 125-134
On twist-closed trios: A new morphic characterization of r.e. sets
Matthias Jantzen
Lecture Notes in Computer Science 1337, 1997, pp. 135-142
An automata approach to some problems on context-free grammars
J. Esparza, P. Rossmanith
Lecture Notes in Computer Science 1337, 1997, pp. 143-152
On aperiodic sets of Wang tiles
Karel Culik, Jarkko Kari
Lecture Notes in Computer Science 1337, 1997, pp. 153-162
Closure under complementation of logspace complexity classes - A survey
Birgit Jenner
Lecture Notes in Computer Science 1337, 1997, pp. 163-175
A relation between sparse and printable sets in NSPACE(\log n)
Bernd Kirsig
Lecture Notes in Computer Science 1337, 1997, pp. 177-184
A foundation for computable analysis
Klaus Weihrauch
Lecture Notes in Computer Science 1337, 1997, pp. 185-199
A computer scientist's view of life, the universe, and everything
Jürgen Schmidhuber
Lecture Notes in Computer Science 1337, 1997, pp. 201-208
Calendars and chronologies
Manfred Kudlek
Lecture Notes in Computer Science 1337, 1997, pp. 209-217
A uniform approach to Petri nets
H. Ehrig, J. Padberg
Lecture Notes in Computer Science 1337, 1997, pp. 219-231
Observing partial order runs of Petri nets
Astrid Kiehn
Lecture Notes in Computer Science 1337, 1997, pp. 233-238
Representation theorems for Petri nets
José Meseguer, Ugo Montanari, Vladimiro Sassone
Lecture Notes in Computer Science 1337, 1997, pp. 239-249
A remark on trace equations
Volker Diekert
Lecture Notes in Computer Science 1337, 1997, pp. 251-260
Verification of distributed algorithms with algebraic Petri nets
Ekkart Kindler, Wolfgang Reisig
Lecture Notes in Computer Science 1337, 1997, pp. 261-270
A short story on action refinement
Walter Vogler
Lecture Notes in Computer Science 1337, 1997, pp. 271-278
Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositonality and all that
Manfred Broy
Lecture Notes in Computer Science 1337, 1997, pp. 279-286

Seiten 1 2 >