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=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
Takeo Yaku
Journal of Computer and System Sciences
12
, 1976, pp. 1-5
Continuous self-reproduction
D. Richardson
Journal of Computer and System Sciences
12
, 1976, pp. 6-12
The semigroup of an algebra automaton
F. Joanne Helton
Journal of Computer and System Sciences
12
, 1976, pp. 13-24
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
Sam Savage
,
Peter Weiner
,
A. Bagchi
Journal of Computer and System Sciences
12
, 1976, pp. 25-35
A completeness property of one-dimensional tessellation automata
Masakazu Nasu
,
Namio Honda
Journal of Computer and System Sciences
12
, 1976, pp. 36-48
Interactive languages
Yoshinori Ezawa
,
Masaharu Mizumoto
,
Junichi Toyoda
,
Kokichi Tanaka
Journal of Computer and System Sciences
12
, 1976, pp. 49-63
The derivation language of a phrase structure grammar
Johnson M. Hart
Journal of Computer and System Sciences
12
, 1976, pp. 64-79
The computational complexity of program schemata
Klaus Weihrauch
Journal of Computer and System Sciences
12
, 1976, pp. 80-107
Sufficient conditions for the convergence of monotonic mathematical programming algorithms
R.R. Meyer
Journal of Computer and System Sciences
12
, 1976, pp. 108-121
On computational reducibility
F.D. Lewis
Journal of Computer and System Sciences
12
, 1976, pp. 122-131
Complexity measures for regular expressions
Andrzej Ehrenfeucht
,
Paul Zeiger
Journal of Computer and System Sciences
12
, 1976, pp. 134-146
Polynomial and abstract subrecursive classes
Kurt Mehlhorn
Journal of Computer and System Sciences
12
, 1976, pp. 147-178
Completeness results for the equivalence of recursive schemas
Bruno Courcelle
,
Jean Vuillemin
Journal of Computer and System Sciences
12
, 1976, pp. 179-197
A characterization of the power of vector machines
Vaughan Pratt
,
Larry Stockmeyer
Journal of Computer and System Sciences
12
, 1976, pp. 198-221
On the equivalence, containment, and covering problems for the regular and context-free languages
Harry B. Hunt III
,
Daniel J. Rosenkrantz
,
Thomas G. Szymanski
Journal of Computer and System Sciences
12
, 1976, pp. 222-268
Systematic approach to reduction and minimization in automata and system theory
Hartmut Ehrig
,
Hans-Jörg Kreowski
Journal of Computer and System Sciences
12
, 1976, pp. 269-304
The existence and construction of free iterative theories
Stephen L. Bloom
,
Calvin C. Elgot
Journal of Computer and System Sciences
12
, 1976, pp. 305-318
On batch scheduling of jobs with stochastic service times and cost structures on a single server
J. Bruno
,
E.G., Jr. Coffman
,
D.B. Johnson
Journal of Computer and System Sciences
12
, 1976, pp. 319-335
Some bounds on the complexity of predicate recognition by finite automata
Y. Breitbart
Journal of Computer and System Sciences
12
, 1976, pp. 336-349
A note on multiple-entry finite automata
Zvi Galil
,
Janos Simon
Journal of Computer and System Sciences
12
, 1976, pp. 350-351
Properties of code events and homomorphisms over regular events
K. Hashiguchi
,
N. Honda
Journal of Computer and System Sciences
12
, 1976, pp. 352-367
Nonexistence of program optimizers in several abstract settings
Donald A. Alton
Journal of Computer and System Sciences
12
, 1976, pp. 368-393
Another proof of the theorem on pattern reproduction in tessellation structures
Peter Gordon Anderson
Journal of Computer and System Sciences
12
, 1976, pp. 394-398
Bounded AFLs
J. Goldstine
Journal of Computer and System Sciences
12
, 1976, pp. 399-419