Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1975

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

Construction of complete sample system for correctness testing
J.M. Barzdin, J.J. Bic̑evskis, A.A. Kalninsh
Lecture Notes in Computer Science 32, 1975, pp. 1-12
Ten years of speedup
Peter van Emde Boas
Lecture Notes in Computer Science 32, 1975, pp. 13-29
On logics of discovery
Petr Hájek
Lecture Notes in Computer Science 32, 1975, pp. 30-45
On models of protection in operating systems
Michael A. Harrison
Lecture Notes in Computer Science 32, 1975, pp. 46-60
Parsing as a subtask of compiling
Jaroslav Král, Jiȓí Demner
Lecture Notes in Computer Science 32, 1975, pp. 61-74
Parallel recursive program schemes
Antoni Mazurkiewicz
Lecture Notes in Computer Science 32, 1975, pp. 75-87
On some problems concerning Pawlak's machines
Miroslav Novotný
Lecture Notes in Computer Science 32, 1975, pp. 88-100
Formal power series and growth functions of Lindenmayer systems
Arto Salomaa
Lecture Notes in Computer Science 32, 1975, pp. 101-113
On the representability of relations by deterministic and nondeterministic multi-tape automata
Peter H. Starke
Lecture Notes in Computer Science 32, 1975, pp. 114-124
On problems solvable by successive trials
B.A. Trakhtenbrot
Lecture Notes in Computer Science 32, 1975, pp. 125-137
Automata and categories
Vȇra Trnková
Lecture Notes in Computer Science 32, 1975, pp. 138-152
On some models of computability of Boolean functions
I.D. Zaslavskiȋ
Lecture Notes in Computer Science 32, 1975, pp. 153-159
Automata and categories: Finiteness contra minimality
Jiȓí Adámek
Lecture Notes in Computer Science 32, 1975, pp. 160-166
Languages over free groups
A.V. Anisimov
Lecture Notes in Computer Science 32, 1975, pp. 167-171
On the comparison of notions of approximation
Giorgio Ausiello, Marco Protasi
Lecture Notes in Computer Science 32, 1975, pp. 172-178
Non-linear speed-up theorem for two register Minsky machines
M. Benes̑ová, I. Korec
Lecture Notes in Computer Science 32, 1975, pp. 179-185
Systems of open paths in Petri nets
Eike Best, Hans Albrecht Schmid
Lecture Notes in Computer Science 32, 1975, pp. 186-193
On the largest full sub-AFL of the full AFL of context-free languages
L. Boasson
Lecture Notes in Computer Science 32, 1975, pp. 194-198
On complexity of nondeterministic Turing machines computations
Michael P. Chytil
Lecture Notes in Computer Science 32, 1975, pp. 199-205
On closure properties of context-free derivation complexity classes
A.Ja. Dikovskiȋ
Lecture Notes in Computer Science 32, 1975, pp. 206-211
Control structures in single block programs
Venelin K. Evtimov
Lecture Notes in Computer Science 32, 1975, pp. 212-218
Minimal Gödel numbers and their identification in the limit
R.V. Freivald
Lecture Notes in Computer Science 32, 1975, pp. 219-225
Isomorphic representation of automata
Ferenc Gécseg
Lecture Notes in Computer Science 32, 1975, pp. 226-230
Extended simple regular expressions
Hartmann J. Genrich
Lecture Notes in Computer Science 32, 1975, pp. 231-237
CONNIVER programs by logical point of view
Giuseppina Gini, Maria Gini
Lecture Notes in Computer Science 32, 1975, pp. 238-245

Seiten 1 2 3 4 5 >