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 YEAR=1975
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proving containment of bounded AFL
Branislav Rovan
Journal of Computer and System Sciences
11
, 1975, pp. 1-55
Hierarchies of Turing machines with restricted tape alphabet size
Oscar H. Ibarra
,
Sartaj K. Sahni
Journal of Computer and System Sciences
11
, 1975, pp. 56-67
Space-bounded reducibility among combinatorial problems
Neil D. Jones
Journal of Computer and System Sciences
11
, 1975, pp. 68-85
Context-free grammar forms
Armin Cremers
,
Seymour Ginsburg
Journal of Computer and System Sciences
11
, 1975, pp. 86-117
Space bounds for processing contentless inputs
A.R. Freedman
,
R.E. Ladner
Journal of Computer and System Sciences
11
, 1975, pp. 118-128
Some properties of the class of
L
languages with interactions
G. Rozenberg
,
K.P. Lee
Journal of Computer and System Sciences
11
, 1975, pp. 129-147
Fault tolerant cellular spaces
Hidenosuke Nishio
,
Youichi Kobuchi
Journal of Computer and System Sciences
11
, 1975, pp. 150-170
Fault tolerant cellular automata
Masateru Harao
,
Shoichi Noguchi
Journal of Computer and System Sciences
11
, 1975, pp. 171-185
Dynamics of discrete systems and pattern reproductions
Václav Rajlich
Journal of Computer and System Sciences
11
, 1975, pp. 186-202
The tape-complexity of context-independent developmental languages
Jan Van Leeuwen
Journal of Computer and System Sciences
11
, 1975, pp. 203-211
Graph grammars and applications to specialization and evolution in biology
Hartmut Ehrig
,
Karl Wilhelm Tischer
Journal of Computer and System Sciences
11
, 1975, pp. 212-236
On ``forgetful'' cellular automata
W.O. Höllerer
,
R. Vollmar
Journal of Computer and System Sciences
11
, 1975, pp. 237-251
Formal grammars and the regeneration capability of biological systems
Adrian Walker
Journal of Computer and System Sciences
11
, 1975, pp. 252-261
Ambiguity in the developmental systems of Lindenmayer
Ann Reedy
,
Walter J. Savitch
Journal of Computer and System Sciences
11
, 1975, pp. 262-283
Computation by assembly
Robert M. Baer
Journal of Computer and System Sciences
11
, 1975, pp. 285-294
An accelerated conjugate direction method to solve linearly constrained minimization problems
Michael J. Best
,
Klaus Ritter
Journal of Computer and System Sciences
11
, 1975, pp. 295-322
On the completeness of the inductive assertion method
J.W. de Bakker
,
L.G.L.T. Meertens
Journal of Computer and System Sciences
11
, 1975, pp. 323-357
Program equivalence and context-free grammars
Barry K. Rosen
Journal of Computer and System Sciences
11
, 1975, pp. 358-374
On some questions of rationality and decidability
Eduardo D. Sontag
Journal of Computer and System Sciences
11
, 1975, pp. 375-381
On reversibility in cellular automata
S. Di Gregorio
,
G. Trautteur
Journal of Computer and System Sciences
11
, 1975, pp. 382-391
Practical decidability
Andrzej Ehrenfeucht
Journal of Computer and System Sciences
11
, 1975, pp. 392-396
Discrete-time machines in closed monoidal categories I
J.A. Goguen
Journal of Computer and System Sciences
10
, 1975, pp. 1-43
Effective proper procedures and universal classes of program schemata
Victor Harnik
Journal of Computer and System Sciences
10
, 1975, pp. 44-61
On tape-bounded complexity classes and multihead finite automata
I.H. Sudborough
Journal of Computer and System Sciences
10
, 1975, pp. 62-76
Some clarifications of the concept of a garden-of-Eden configuration
Serfino Amoroso
,
Gerald Cooper
,
Yale Patt
Journal of Computer and System Sciences
10
, 1975, pp. 77-82
Seiten 1
2
>