default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 4
Volume 4, Number 1, February 1970
- H. Raymond Strong:
Depth-Bounded Computation. 1-14 - Herbert B. Keller:
Newton's Method under Mild Differential Conditions. 15-28 - Allen A. Goldstein, James S. Meditch:
Nonlinear Optimal Controls. 29-37 - R. Conti:
A Convex Programming Problem in Banach Spaces and Applications to Optimum Control Theory. 38-49 - Patrick C. Fischer, Albert R. Meyer
, Arnold L. Rosenberg:
Time-Restricted Sequence Generation. 50-73 - Richard J. Orgass:
Some Results Concerning Proofs of Statements about Programs. 74-88
Volume 4, Number 2, April 1970
- Franco P. Preparata, David E. Muller:
Generation of Near-Optimal Universal Boolean Functions. 93-102 - Alex McNabb, Alan Schumitzky:
Factorization of Operators II: A Nonlinear Volterra Method for Numerical Solution of Linear Fredholm Equations. 103-128 - Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft:
On the Computational Power of Pushdown Automata. 129-136 - Hisao Yamada, Serafino Amoroso:
A Completeness Problem for Pattern Generation in Tessellation Automata. 137-176 - Walter J. Savitch:
Relationships Between Nondeterministic and Deterministic Tape Complexities. 177-192
Volume 4, Number 3, June 1970
- Gene F. Rose:
Abstract Families of Processors. 193-204 - Robin Milner:
Equivalences on Program Schemes. 205-219 - David C. Luckham, David Michael Ritchie Park, Mike Paterson:
On Formalised Computer Programs. 220-249 - Roger Temam:
Remarks on the Approximation of Some Nonlinear Elliptic Equations. 250-259 - Rina S. Cohen, Janusz A. Brzozowski:
General Properties of Star Height of Regular Events. 260-280 - Rina S. Cohen:
Star Height of Certain Families of Regular Events. 281-297
Volume 4, Number 4, August 1970
- Leonard Y. Liu, Peter Weiner:
A Characterization of Semilinear Sets. 299-307 - Seymour Ginsburg, Sheila A. Greibach:
Principal AFL. 308-338 - James W. Thatcher:
Generalized Sequential Machine Maps. 339-367 - Juris Hartmanis, John E. Hopcroft:
What makes Some Language Theory Problems Undecidable. 368-376 - Ramon E. Moore:
On the Stability of Linear Recurrence Equations with Arbitrary Time Lags. 377-383
Volume 4, Number 5, October 1970
- William Bridges Smith:
Error Detection in Formal Languages. 385-405 - John Doner:
Tree Acceptors and Some of Their Applications. 406-451 - Sanat K. Basu:
On the Structure of Subrecursive Degrees. 452-464 - Webb Miller:
Recursive Function Theory and Numerical Analysis. 465-472 - Edward Angel:
Invariant Imbedding, Difference Equations, and Elliptic Boundary Value Problems. 473-491 - Takumi Kasai:
An Hierarchy Between Context-Free and Context-Sensitive Languages. 492-508
Volume 4, Number 6, December 1970
- A. L. Perrie:
Uniform Rational Approximation with Osculatory Interpolation. 509-522 - Alfred V. Aho, Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages. 523-538 - Yehoshafat Give'on, Yechezkel Zalcstein:
Algebraic Structures in Linear Systems Theory. 539-556 - Yoshiyuki Skawa:
An Application of the Epsilon Technique to the Solution of Pursuit and Evasion Problems. 557-569 - Kailash C. Kapur, Richard M. Van Slyke:
Cutting Plane Algorithms and State Space Constrained Linear Optimal Control Problems. 570-605 - Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Time- and Tape-Bounded Turing Acceptors and AFLs. 606-621 - Ronald V. Book, Sheila A. Greibach, Oscar H. Ibarra, Ben Wegbreit:
Tape-Bounded Turing Acceptors and Principal AFLs. 622-625
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 2025-12-09 23:27 CET 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:
