Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=520

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

Elimination of negation in term algebras
J.-L. Lassez, M. Maher, K. Marriott
Lecture Notes in Computer Science 520, 1991, pp. 1-16
Rewrite orderings and termination of rewrite systems
Pierre Lescanne
Lecture Notes in Computer Science 520, 1991, pp. 17-27
On the faithfulness of formal models
Zohar Manna, Amir Pnueli
Lecture Notes in Computer Science 520, 1991, pp. 28-42
Models for concurrency
Mogens Nielsen
Lecture Notes in Computer Science 520, 1991, pp. 43-46
On a hierarchy of file types and a tower of their theories
Andrzej Salwicki
Lecture Notes in Computer Science 520, 1991, pp. 47-63
Strong conjunction and intersection types
Fabio Alessi, Franco Barbanera
Lecture Notes in Computer Science 520, 1991, pp. 64-73
Partial higher-order specifications
Egidio Astesiano, Maura Cerioli
Lecture Notes in Computer Science 520, 1991, pp. 74-83
Unification in incompletely specified theories. A case study
Staffan Bonnier
Lecture Notes in Computer Science 520, 1991, pp. 84-92
Observing localities
G. Boudol, I. Castellani, M. Hennessy, A. Kiehn
Lecture Notes in Computer Science 520, 1991, pp. 93-102
Abstract dynamic data types: A temporal logic approach
Gerardo Costa, Gianna Reggio
Lecture Notes in Computer Science 520, 1991, pp. 103-112
Generating words by cellular automata
Anton C̑erný
Lecture Notes in Computer Science 520, 1991, pp. 113-120
Atomic refinement in process description languages
Pierpaolo Degano, Roberto Gorrieri
Lecture Notes in Computer Science 520, 1991, pp. 121-130
Recognizable complex trace languages
Volker Diekert, Paul Gastin, Antoine Petit
Lecture Notes in Computer Science 520, 1991, pp. 131-140
Solving systems of linear diophantine equations: An algebraic approach
Eric Domenjoud
Lecture Notes in Computer Science 520, 1991, pp. 141-150
A second-order pattern matching algorithm for the cube of typed \lambda-calculi
Gilles Dowek
Lecture Notes in Computer Science 520, 1991, pp. 151-160
The lazy call-by-value \lambda-calculus
Lavinia Egidi, Furio Honsell, Simona Ronchi della Roca
Lecture Notes in Computer Science 520, 1991, pp. 161-169
The limit of \mbox{split}_n-bisimulations for CCS agents
Roberto Gorrieri, Cosimo Laneve
Lecture Notes in Computer Science 520, 1991, pp. 170-180
Stochastic automata and length distributions of rational languages
Georges Hansel, Daniel Krob, Christian Michaux
Lecture Notes in Computer Science 520, 1991, pp. 181-190
Towards a categorical semantics of type classes
Barney P. Hilken, David E. Rydeheard
Lecture Notes in Computer Science 520, 1991, pp. 191-201
Single-path Petri nets
Rodney R. Howell, Petr Janc̑ar, Louis E. Rosier
Lecture Notes in Computer Science 520, 1991, pp. 202-210
The bisection problem for graphs of degree 4 (configuring transputer systems)
Juraj Hromkovic̑, Burkhard Monien
Lecture Notes in Computer Science 520, 1991, pp. 211-220
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Oscar H. Ibarra, Tao Jiang, Hui Wang
Lecture Notes in Computer Science 520, 1991, pp. 221-230
Infinite normal forms for non-linear term rewriting systems
P. Inverardi, M. Nesi
Lecture Notes in Computer Science 520, 1991, pp. 231-239
Two algorithms for approximate string matching in static texts
Petteri Jokinen, Esko Ukkonen
Lecture Notes in Computer Science 520, 1991, pp. 240-248
Efficient constructions of test sets for regular and context-free languages
Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
Lecture Notes in Computer Science 520, 1991, pp. 249-258

Seiten 1 2 >