Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dot-depth of star-free events
Rina S. Cohen
,
J.A. Brzozowski
Journal of Computer and System Sciences
5
, 1971, pp. 1-16
The concept of effective method applied to computational problems of linear algebra
Oliver Aberth
Journal of Computer and System Sciences
5
, 1971, pp. 17-25
Realizations by stochastic finite automata
J.W. Carlyle
,
A. Paz
Journal of Computer and System Sciences
5
, 1971, pp. 26-40
Classification of non counting events
J.A. Brzozowski
,
K. C̑ulík II
,
A. Gabrielian
Journal of Computer and System Sciences
5
, 1971, pp. 41-53
The use of lists in the study of undecidable problems in automata theory
J. Hartmanis
,
F. Lewis
Journal of Computer and System Sciences
5
, 1971, pp. 54-66
Algorithmic approximations
Erwin Engeler
Journal of Computer and System Sciences
5
, 1971, pp. 67-82
On the isolation of the roots of a non-linear operator
A.A. Goldstein
,
F.C. Johnson
,
Jürgen Spiess
Journal of Computer and System Sciences
5
, 1971, pp. 83-87
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
Oscar H. Ibarra
Journal of Computer and System Sciences
5
, 1971, pp. 88-117
Abstract computational complexity and cycling computations
Giorgio Ausiello
Journal of Computer and System Sciences
5
, 1971, pp. 118-128
Extensions of asynchronous circuits and the delay problem. Part II: Spike-free extensions and the delay problem of the second kind
Izumi Kimura
Journal of Computer and System Sciences
5
, 1971, pp. 129-162
A computational approach to the maximum principle
A.V. Balakrishnan
Journal of Computer and System Sciences
5
, 1971, pp. 163-191
Data graphs and addressing schemes
Arnold L. Rosenberg
Journal of Computer and System Sciences
5
, 1971, pp. 193-238
Mathematical theory of partial correctness
Zohar Manna
Journal of Computer and System Sciences
5
, 1971, pp. 239-253
Translating recursion equations into flow charts
H.R., Jr. Strong
Journal of Computer and System Sciences
5
, 1971, pp. 254-285
The enumerability and invariance of complexity classes
F.D. Lewis
Journal of Computer and System Sciences
5
, 1971, pp. 286-303
Three theorems concerning principal AFLs
J.S. Ullian
Journal of Computer and System Sciences
5
, 1971, pp. 304-314
Subrecursive programming languages II. On program size
Robert L. Constable
Journal of Computer and System Sciences
5
, 1971, pp. 315-334
Unilateral context sensitive grammars and left-to-right parsing
György Révész
Journal of Computer and System Sciences
5
, 1971, pp. 337-352
A characterization of context-free languages
Jozef Gruska
Journal of Computer and System Sciences
5
, 1971, pp. 353-364
AFL with the semilinear property
Seymour Ginsburg
,
Edwin H. Spanier
Journal of Computer and System Sciences
5
, 1971, pp. 365-396
Time-bounded grammars and their languages
Ronald V. Book
Journal of Computer and System Sciences
5
, 1971, pp. 397-429
Minimum error bounds for multidimensional spline approximation
J.B. Rosen
Journal of Computer and System Sciences
5
, 1971, pp. 430-452
Tessellation structures for reproduction of arbitrary patterns
Serafino Amoroso
,
Gerald Cooper
Journal of Computer and System Sciences
5
, 1971, pp. 455-464
Operation-preserving functions and autononous factors of finite automata
Jerzy W. Grzymala-Busse
Journal of Computer and System Sciences
5
, 1971, pp. 465-474
Towards a theory of data structures
A.C. Fleck
Journal of Computer and System Sciences
5
, 1971, pp. 475-488
Seiten 1
2
>