Information and Computation
, Volume 13
Volume 13, Number 1, 1968
Arthur T. Pu
: Generalized Decomposition of Incomplete Finite Automata. 1-19
BibTeX
W. E. Hartnett
: Generalization of Tests for Certain Properties of Variable-Length Codes. 20-45
BibTeX
A. D. Wyner
,
Ronald L. Graham
: An Upper Bound on Minimum Distance for a k-ary Code. 46-52
BibTeX
Kazuo Horiuchi
: Sampling Principle for Continuous Signals with Time-Varying Bands. 53-61
BibTeX
Tyrone E. Duncan
: Evaluation of Likelihood Functions. 62-74
BibTeX
H. Tanaka
,
M. Kasahara
,
Y. Tezuka
,
Y. Kasahara
: Computation over Galois Fields Using Shiftregisters. 75-84
BibTeX
Volume 13, Number 2, 1968
Arto Salomaa
: On Finite Automata with a Time-Variant Structure. 85-98
BibTeX
T. T. Nieh
: Stochastic Sequential Machines with Prescribed Performance Criteria. 99-113
BibTeX
John E. Hopcroft
,
Jeffrey D. Ullman
: Sets Accepted by One-Way Stack Automata Are Context Sensitive. 114-133
BibTeX
Edward L. Cohen
,
Shimshon Berkovits
: Exponential Distributions in Markov Chain Models for Communication Channels. 134-139
BibTeX
Raymond T. Yeh
: On Relational Homomorphisms of Automata. 140-155
BibTeX
Carl W. Helstrom
: Detection Theory and Quantum Mechanics (II). 156-171
BibTeX
Volume 13, Number 3, 1968
C. E. Hutchinson
,
Y. T. Chon
,
R. A. Leuchs
: An Analysis of the Effect of Integral and Sigma Pulse Frequency Modulation on White Noise. 173-185
BibTeX
Alfred V. Aho
,
John E. Hopcroft
,
Jeffrey D. Ullman
: Time and Tape Complexity of Pushdown Automaton Languages. 186-206
BibTeX
Neil D. Jones
: Classes of Automata and Transitive Closure. 207-229
BibTeX
Jerome Feder
: Languages of Encoded Line Patterns. 230-244
BibTeX
Kojiro Kobayashi
: Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers. 245-253
BibTeX
Toby Berger
: Rate Distortion Theory for Sources with Abstract Alphabets and Memory. 254-273
BibTeX
Hiroshi Sato
: A Note on Stationary of Some Random Processes. 274-279
BibTeX
Volume 13, Number 4, 1968
Wai-hung Ng
,
Paul E. Pfeiffer
: Minimum-Hamming-Distance Decoding of Single-Generator Binary Convolutional Codes. 195-315
BibTeX
P. Balasubrahmanyam
,
Gift Siromoney
: A Note on Entropy of Telugu Prose. 281-285
BibTeX
Brian D. O. Anderson
,
John B. Moore
: Optimal State Estimation in High Noise. 286-294
BibTeX
J. D. Simon
,
S. K. Mitter
: A Theory of Modal Control. 316-353
BibTeX
E. J. Weldon Jr.
: A Note on Synchronization Recovery with Extended Cyclic Codes. 354-356
BibTeX
Sudhakar M. Reddy
: Further Results on Convolutional Codes Derived from Block Codes. 357-362
BibTeX
Eugene S. Santos
: Maximin Automata. 363-377
BibTeX
Franco P. Preparata
: A Class of Optimum Nonlinear Double-Error-Correcting Codes. 378-400
BibTeX
Volume 13, Number 5, 1968
Henry D. Chadwick
,
Ludwik Kurz
: Two Sequential Nonparametric Detection Procedures. 403-428
BibTeX
David M. Mandelbaum
: A Note on Synchronizable Error-Correcting Codes. 429-432
BibTeX
Michael A. Harrison
,
Oscar H. Ibarra
: Multi-Tape and Multi-Head Pushdown Automata. 433-470
BibTeX
David K. Chow
: On Threshold Decoding of Cyclic Codes. 471-483
BibTeX
Walter S. Brainerd
: The Minimalization of Tree Automata. 484-491
BibTeX
Volume 13, Number 6, 1968
K. Mani Chandy
,
C. V. Ramamoorthy
: Optimization of Information Storage Systems. 509-526
BibTeX
Irving L. Traiger
,
A. Gill
: On an Asymptotic Optimization Problem in Finite, Directed, Weighted Graphs. 527-533
BibTeX
Thomas Kailath
: A Note on Least-Squares Estimates from Likelihood Ratios. 534-540
BibTeX
Neal Zierler
,
John Brillhart
: On Primitive Trinomials (Mod 2). 541-554
BibTeX
Yoshiko Takenaka
: On the Existence of a Hamiltonian Path in a Graph. 555-564
BibTeX
C. Pair
,
Alain Quéré
: Définition et Etude des Bilangages Réguliers. 565-593
BibTeX
Udo Augustin
: The Capacity of the Product Channel. 594-596
BibTeX
Douglas C. Bossen
,
S. S. Yau
: Redundant Residue Polynomial Codes. 597-618
BibTeX
Ronald Alter
: On the Non-Existence of Perfect Double Hamming-Error-Correcting Codes on q = 8 and q = 9 Symbols. 619-627
BibTeX
Copyright ©
Sat May 16 23:59:52 2009 by
Michael Ley
(
ley@uni-trier.de
)