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=1973
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On AFL generators for finitely encoded AFA
Seymour Ginsburg
,
Sheila Greibach
Journal of Computer and System Sciences
7
, 1973, pp. 1-27
On two-way multihead automata
Oscar H. Ibarra
Journal of Computer and System Sciences
7
, 1973, pp. 28-36
Web grammars and several graphs
Norihiro Abe
,
Masaharu Mizumoto
,
Jun-Ichi Toyoda
,
Kohkichi Tanaka
Journal of Computer and System Sciences
7
, 1973, pp. 37-65
LR-regular grammars - an extension of
LR(k)
grammars
Karel C̑ulík II
,
Rina Cohen
Journal of Computer and System Sciences
7
, 1973, pp. 66-96
Algorithms for producing grammars from sample derivations: A common problem of formal language theory and developmental biology
Horacio Feliciangeli
,
Gabor T. Herman
Journal of Computer and System Sciences
7
, 1973, pp. 97-118
Program schemes, recursion schemes, and formal languages
Stephen J. Garland
,
David C. Luckham
Journal of Computer and System Sciences
7
, 1973, pp. 119-160
Every discrete input machine is linearly simulatable
Bernard P. Zeigler
Journal of Computer and System Sciences
7
, 1973, pp. 161-167
Group theoretic characterization of linear permutation automata
Juris Hartmanis
,
H. Walter
Journal of Computer and System Sciences
7
, 1973, pp. 168-188
Optimal algorithms for parallel polynomial evaluation
I. Munro
,
M.S. Paterson
Journal of Computer and System Sciences
7
, 1973, pp. 189-198
On the extension of Gladkij's theorem and the hierarchies of languages
Yoshihide Igarashi
,
Namio Honda
Journal of Computer and System Sciences
7
, 1973, pp. 199-217
The equivalence problem for deterministic two-tape automata
Malcolm Bird
Journal of Computer and System Sciences
7
, 1973, pp. 218-236
Strict deterministic grammars
Michael A. Harrison
,
Ivan M. Havel
Journal of Computer and System Sciences
7
, 1973, pp. 237-277
Coproducts and decomposable machines
Michael A. Arbib
Journal of Computer and System Sciences
7
, 1973, pp. 278-287
Establishing certain bounds concerning finite automata
Zvi Kohavi
,
Joseph Winograd
Journal of Computer and System Sciences
7
, 1973, pp. 288-299
A structure theory of automata characterized by groups
Yoshifumi Masunaga
,
Shoichi Noguchi
,
Juro Oizumi
Journal of Computer and System Sciences
7
, 1973, pp. 300-305
Approximate solutions and error bounds for quasilinear elliptic boundary value problems
To-Yat Cheung
Journal of Computer and System Sciences
7
, 1973, pp. 306-322
A
V\log V
algorithm for isomorphism of triconnected planar graphs
J.E. Hopcroft
,
R.E. Tarjan
Journal of Computer and System Sciences
7
, 1973, pp. 323-331
A bound on the multiplicative efficiency of iteration
H.T. Kung
Journal of Computer and System Sciences
7
, 1973, pp. 334-342
A hierarchy for nondeterministic time complexity
Stephen A. Cook
Journal of Computer and System Sciences
7
, 1973, pp. 343-353
Time-bounded random access machines
S.A. Cook
,
R.A. Reckhow
Journal of Computer and System Sciences
7
, 1973, pp. 354-375
Process complexity and effective random tests
C.P. Schnorr
Journal of Computer and System Sciences
7
, 1973, pp. 376-388
Maze recognizing automata and nondeterministic tape complexity
Walter J. Savitch
Journal of Computer and System Sciences
7
, 1973, pp. 389-403
Characterizations of flowchartable recursions
S.A. Walker
,
H.R. Strong
Journal of Computer and System Sciences
7
, 1973, pp. 404-447
Time bounds for selection
M. Blum
,
R.W. Floyd
,
V.R. Pratt
,
R.L. Rivest
,
R.E. Tarjan
Journal of Computer and System Sciences
7
, 1973, pp. 448-461
The unsolvability of the equality problem for sentential forms of context-free grammars
Meera Blattner
Journal of Computer and System Sciences
7
, 1973, pp. 463-468
Seiten 1
2
>