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=1971
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Every finite sequential machine is linearly realizable
G.T. Herman
Journal of Computer and System Sciences
5
, 1971, pp. 489-510
Marked directed graphs
F. Commoner
,
A.W. Holt
Journal of Computer and System Sciences
5
, 1971, pp. 511-523
Algebraic theory of finite Fourier transforms
Peter J. Nicholson
Journal of Computer and System Sciences
5
, 1971, pp. 524-547
Finite-turn checking automata
Rani Siromoney
Journal of Computer and System Sciences
5
, 1971, pp. 549-559
Pair grammars, graph languages and string-to-graph translations
Terrence W. Pratt
Journal of Computer and System Sciences
5
, 1971, pp. 560-595
Abstract families of relations
Karel C̑ulík II
Journal of Computer and System Sciences
5
, 1971, pp. 596-606
On fully indecomposable matrices
Trevor I. Fenner
,
Georghios Loizou
Journal of Computer and System Sciences
5
, 1971, pp. 607-622
Pattern reproduction in tessellation automata of arbitrary dimension
Thomas J. Ostrand
Journal of Computer and System Sciences
5
, 1971, pp. 623-628
Substitution expressions
I.P. McWhirter
Journal of Computer and System Sciences
5
, 1971, pp. 629-637
Seiten
<
1
2