Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 42
Volume 42, Number 1, 1979
- C. M. Reis, Gabriel Thierrin:
Reflective Star Languages and Codes. 1-9 - F. Göbel, Cornelis Hoede:
On an Optimality Property of Ternary Trees. 10-26 - Sheila A. Greibach:
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia. 27-37 - Kazuhiko Ozeki:
A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion. 38-59 - Gabor T. Herman, Henry Hurwitz, Arnold Lent, Hsi-Ping Lung:
On the Bayesian Approach to Image Reconstruction. 60-71 - Mihalis Yannakakis, Theodosios Pavlidis:
Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars. 72-86 - Paul E. Murphy, Marvin C. Paull:
Minimum Comparison Merging of Sets of Approximately Equal Size. 87-96 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Context-Dependent L Forms. 97-118
Volume 42, Number 2, 1979
- Y. K. Chan, K. K. Siu, Po Tong:
Two-Dimensional Binary Arrays with Good Autocorrelation. 125-130 - Quentin L. Klein, Martin E. Kaliski:
Functional Equivalence in a Class of Autonomous One-Dimensional Nonlinear Discrete-Time Systems. 131-147 - Wolfgang Thomas:
Star-Free Regular Sets of omega-Sequences. 148-156 - Joost Engelfriet, Giora Slutzki:
Bounded Nesting in Macro Grammars. 157-193 - Michel Latteux:
Substitutions dans le EDTOL Systèmes Ultralinéaires. 194-260
Volume 42, Number 3, 1979
- Reihaneh Safavi-Naini, Ian F. Blake:
Generalized t-Designs and Weighted Majority Decoding. 261-282 - Sorin Istrail:
On Complements of Some Bounded Context-Sensitive Languages. 283-289 - Shmuel Peleg
:
Maximal Derivations for Probabilistic Strings in Stochastic Languages. 290-304 - Angela Y. Wu, Azriel Rosenfeld:
Cellular Graph Automata. I. Basic Concepts, Graph Property Measurement, Closure Properties. 305-329 - Angela Y. Wu, Azriel Rosenfeld:
Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition. 330-353 - Rainer Kemp:
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar. 354-365
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 2024-05-10 18:47 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:
