Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=28

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

Sequential functions and generalized Moore and Mealy automata
Jiȓí Bec̑váȓ
Lecture Notes in Computer Science 28, 1975, pp. 1-8
Mathematical methods of the theory of stochastic automata
A. Bertoni
Lecture Notes in Computer Science 28, 1975, pp. 9-22
On the quasi-controllability of automata
L. Beyga
Lecture Notes in Computer Science 28, 1975, pp. 23-25
Models for analysis of races in sequential networks
J. Brzozowski, M. Yoeli
Lecture Notes in Computer Science 28, 1975, pp. 26-32
Factorizations, congruences, and the decomposition of automata and systems
J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright
Lecture Notes in Computer Science 28, 1975, pp. 33-45
On the periodic sum and extensions of finite automata
Jerzy W. Grzymala-Busse
Lecture Notes in Computer Science 28, 1975, pp. 46-52
Finite branching automata: Automata theory motivated by problem solving
Ivan M. Havel
Lecture Notes in Computer Science 28, 1975, pp. 53-61
On configurations in cellular automata
Peter Mikulecký
Lecture Notes in Computer Science 28, 1975, pp. 62-68
Finite automata acceptation of infinite sequences
K. Wagner, L. Staiger
Lecture Notes in Computer Science 28, 1975, pp. 69-72
R-fuzzy automata with a time-variant structure
W. Wechler
Lecture Notes in Computer Science 28, 1975, pp. 73-76
Functions computable in the limit by probabilistic machines
R.V. Freivald
Lecture Notes in Computer Science 28, 1975, pp. 77-87
Some properties of limit recursive functions
B. Goetze, R. Klette
Lecture Notes in Computer Science 28, 1975, pp. 88-90
On some approximation problems of continuous computation
B. Konikowska
Lecture Notes in Computer Science 28, 1975, pp. 91-106
Set-theoretic properties of programs in stored program computers
W. Kwasowiec
Lecture Notes in Computer Science 28, 1975, pp. 107-113
Classification of programs of a SPC
Z. Raś
Lecture Notes in Computer Science 28, 1975, pp. 114-125
The algebraic approach to the theory of computing systems
Jerzy Tiuryn
Lecture Notes in Computer Science 28, 1975, pp. 126-142
Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables
W. Żakowski
Lecture Notes in Computer Science 28, 1975, pp. 143-156
An approach to correctness proofs of semicoroutines
Ole-Johan Dahl
Lecture Notes in Computer Science 28, 1975, pp. 157-174
Towards an understanding of complex processes
P. Dembiński
Lecture Notes in Computer Science 28, 1975, pp. 175-185
Simulation
A. Skowron
Lecture Notes in Computer Science 28, 1975, pp. 186-201
Concurrent programs
J. Winkowski
Lecture Notes in Computer Science 28, 1975, pp. 202-221
Ultralinear expressions
J.P. Crestin
Lecture Notes in Computer Science 28, 1975, pp. 222-231
A family of algebraic systems related to the theory of equations on free monoids
Max Fontet
Lecture Notes in Computer Science 28, 1975, pp. 232-248
Stretching by probabilistic tree automata and Santos grammars
Marek Karpiński
Lecture Notes in Computer Science 28, 1975, pp. 249-255
Top down versus bottom up syntax analysis revised
J. Král
Lecture Notes in Computer Science 28, 1975, pp. 256-273

Seiten 1 2 >