Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 16
Volume 16, Number 1, 1970
- Nicolaos S. Tzannes, Richard V. Spencer, Arnold J. Kaplan:
On Estimating the Entropy of Random Fields. 1-6
- Sheila A. Greibach:
Full AFLs and Nested Iterated Substitution. 7-35 - Zoltán Daróczy:
Generalized Information Functions. 36-51 - K. Vairavan:
Input-Output Relations of Finite Memory Systems. 52-65 - Wolffried Stucky, Hermann K.-G. Walter:
Minimal Linear Realizations of Autonomous Automata. 66-84 - Keinosuke Fukunaga, Warren L. G. Koontz:
Representation of Random Processes Using the Finite Karhunen-Loève Expansion. 85-101 - Arthur T. Pu:
Erratum: "Generalized Decomposition of Incomplete Finite Automata". 102
Volume 16, Number 2, 1970
- Silviu Guiasu:
An Informational Model for Two-Person Games. 103-122 - James F. Korsh:
On Decisions and Information Concerning an Unknown Parameter. 123-127 - Edward A. Patrick, Frederic P. Fischer III:
A Generalized k-Nearest Neighbor Rule. 128-152 - Stafford E. Tavares, M. Fukada:
Synchronization of a Class of Codes Derived from Cyclic Codes. 153-166 - Jack K. Wolf, Aaron D. Wyner, Jacob Ziv:
The Channel Capacity of the Postal Channel. 167-172 - Werner Kuich:
On the Entropy of Context-Free Languages. 173-20 - Neil D. Jones:
A Note on the Index of a Context-Free Language. 201-202
Volume 16, Number 3, 1970
- Toshio Yasui, Shuzo Yajima:
Two-State Two-Symbol Probabilistic Automata. 203-224 - Sudhakar M. Reddy, George I. Davida, John P. Robinson:
A Class of High-Rate Double-Error-Correcting Convolutional Codes. 225-230 - Harry T. Hsu:
A Large Class of Cyclic and Shortened Cyclic Binary Codes for Multiple Error Correction. 231-242 - Ugo Montanari:
Separable Graphs, Planar Graphs and Web Grammars. 243-267 - Udo Augustin:
Infinite-Alphabet Channels and the Method of Codes of a Fixed Composition. 268-284 - Robert Knast:
Representability of Nonregular Languages in Finite Probabilistic Automata. 285-302
Volume 16, Number 4, 1970
- Tyrone E. Duncan:
Likelihood Functions for Stochastic Signals in White Noise. 303-310 - Leo I. Blustein:
Exponential Error Bounds for Discrete Memoryless Channels with Sequential Decision Feedback. 311-318 - David M. Mandelbaum:
On Efficient Burst Correcting Residue Polynomial Codes. 319-330 - Terrence Fine:
Extrapolation When Very Little is Known about the Source. 331-359 - Armen Gabrielian:
The Theory of Interacting Local Automata. 360-377 - D. Chazan, B. Weiss:
Higher Order Autocorrelation Functions as Translation Invariants. 378-383 - Ján Cerný:
Approximation in the Space of Information Channels. 384-395 - Jacobus H. van Lint:
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q). 396-401
Volume 16, Number 5, 1970
- Philippe Delsarte, Jean-Marie Goethals, F. Jessie MacWilliams:
On Generalized Reed-Muller Codes and Their Relatives. 403-442 - Jacques Loeckx:
The Parsing for General Phrase-Structure Grammars. 443-464 - Azaria Paz:
Counterexamples and Bounds for Graphs Solvable with Finite Delay. 465-472 - Wah-Chun Chan:
A Computer Processing Queueing System with Feedback. 473-486 - Erol Gelenbe:
On Languages Defined by Linear Probabilistic Automata. 487-501 - Neal Zierler:
On x^n + x + 1 over GF(2). 502-505
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-03-31 23:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
