Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=45

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

Determinism in concurrent systems
Wƚodzimierz Kwasowiec
Lecture Notes in Computer Science 45, 1976, pp. 408-415
Generating control mechanisms by restrictions
K. Lautenbach, H. Wedde
Lecture Notes in Computer Science 45, 1976, pp. 416-422
On diagnosis of algorithmical processes
J.W. Ła̧ski
Lecture Notes in Computer Science 45, 1976, pp. 423-429
On some properties of cyclic automata and their extensions
Bolesƚaw Mikoƚajczak
Lecture Notes in Computer Science 45, 1976, pp. 430-435
Compiler generation using denotational semantics
P.D. Mosses
Lecture Notes in Computer Science 45, 1976, pp. 436-441
On divergence problem for program schemas
V.A. Nepomniaschy
Lecture Notes in Computer Science 45, 1976, pp. 442-445
On the parsing of LL-regular grammars
Anton Nijholt
Lecture Notes in Computer Science 45, 1976, pp. 446-452
The characteristic polynomial of a finite automaton
D. Perrin
Lecture Notes in Computer Science 45, 1976, pp. 453-457
Error detection using regular languages
P. Prusinkiewicz
Lecture Notes in Computer Science 45, 1976, pp. 458-464
On a relationship between programs of address machines and Mazurkiewicz algorithms
Zbigniew Raś
Lecture Notes in Computer Science 45, 1976, pp. 465-471
Dijkstra's predicate transformer, non-determinism, recursion, and termination
W.P. de Roever
Lecture Notes in Computer Science 45, 1976, pp. 472-481
Context-free programmed grammars and ETOL systems
G. Rozenberg, D. Vermeir
Lecture Notes in Computer Science 45, 1976, pp. 482-487
Context-free algebra: A mathematical device for compiler specification
Teodor Rus
Lecture Notes in Computer Science 45, 1976, pp. 488-494
On the lower bound for minimum comparison selection
Peter Ruz̑ic̑ka, Juraj Wiedermann
Lecture Notes in Computer Science 45, 1976, pp. 495-502
Computational processes generated by programs with /recursive/ procedures and block structures
A. Salwicki, T. Müldner
Lecture Notes in Computer Science 45, 1976, pp. 503-509
An algebraic framework for the study of the syntactic monoids application to the group languages
J. Sakarovitch
Lecture Notes in Computer Science 45, 1976, pp. 510-516
Degrees of parallelism in computations
V.Yu. Sazonov
Lecture Notes in Computer Science 45, 1976, pp. 517-523
On adaptability of a system of programs
A. Schurmann
Lecture Notes in Computer Science 45, 1976, pp. 524-529
A mathematical model of parallel information processing
A. Skowron
Lecture Notes in Computer Science 45, 1976, pp. 530-536
Powerdomains
M.B. Smyth
Lecture Notes in Computer Science 45, 1976, pp. 537-543
On the domain of iteration in iterative algebraic theories
J. Tiuryn
Lecture Notes in Computer Science 45, 1976, pp. 544-550
The influence of the data presentation on the computational power of machines
Rutger Verbeek, Klaus Weihrauch
Lecture Notes in Computer Science 45, 1976, pp. 551-558
On sequential modelling of non-sequential processes
Józef Winkowski
Lecture Notes in Computer Science 45, 1976, pp. 559-568
Equivalence and optimization of recursive program schemata
Zbigniew Zwinogrodzki
Lecture Notes in Computer Science 45, 1976, pp. 569-575
Observability concepts in abstract data type specification
V. Giarratana, F. Gimona, U. Montanari
Lecture Notes in Computer Science 45, 1976, pp. 576-587

Seiten < 1 2 3 4 >