default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 5
Volume 5, Number 1, February 1971
- Rina S. Cohen, Janusz A. Brzozowski:
Dot-Depth of Star-Free Events. 1-16 - Oliver Aberth:
The Concect of Effective Method Applied to Computational Problems of Linear Algebra. 17-25 - Jack W. Carlyle, Azaria Paz:
Realizations by Stochastic Finite Automata. 26-40 - Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian:
Classification of Noncounting Events. 41-53 - Juris Hartmanis, Forbes D. Lewis:
The use of Lists in the Study of Undecidable Problems in Automata Theory. 54-66 - Erwin Engeler:
Algorithmic Approximations. 67-82
Volume 5, Number 2, April 1971
- Allen A. Goldstein, F. C. Johnson, Jürgen Spiess:
On the Isolation of the Roots of a Non-Linear Operator. 83-87 - Oscar H. Ibarra:
Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata. 88-117 - Giorgio Ausiello:
Abstract Computational Complexity and Cycling Computations. 118-128 - Izumi Kimura:
Extensions of Asynchronous Circuits and the Delay Problem. Part II: Spike-Free Extensions and the Delay Problem of the Second Kind. 129-162 - A. V. Balakrishnan:
A Computational Approach to the Maximum Principle. 163-191
Volume 5, Number 3, June 1971
- Arnold L. Rosenberg:
Data Graphs and Addressing Schemes. 193-238 - Zohar Manna:
Mathematical Theory of Partial Correctness. 239-253 - H. R. Strong Jr.:
Translating Recursion Equations into Flow Charts. 254-285 - Forbes D. Lewis:
The Enumerability and Invariance of Complexity Classes. 286-303 - Joseph S. Ullian:
Three Theorems Concerning Principal AFLs. 304-314 - Robert L. Constable:
Subrecursive Programming Languages. II. On Program Size. 315-334
Volume 5, Number 4, August 1971
- György E. Révész:
Unilateral Context Sensitive Grammars and Left-to-Right Parsing. 337-352 - Jozef Gruska:
A Characterization of Context-free Languages. 353-364 - Seymour Ginsburg, Edwin H. Spanier:
AFL with the Semilinear Property. 365-396 - Ronald V. Book:
Time-Bounded Grammars and Their Languages. 397-429 - J. Ben Rosen:
Minimum Error Bounds for Multidimensional Spline Approximation. 430-452 - John Doner:
Erratum: Tree Acceptors and Some of Their Applications. 453
Volume 5, Number 5, October 1971
- Serafino Amoroso, Gerald Cooper:
Tessellation Structures for Reproduction of Arbitrary Patterns. 455-464 - Jerzy W. Grzymala-Busse:
Operation-Preserving Functions and Autononous Factors of Finite Automata. 465-474 - Arthur C. Fleck:
Towards a Theory of Data Structures. 475-488 - Gabor T. Herman:
Every Finite Sequential Machine is Linearly Realizable. 489-510 - Frederic G. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli:
Marked Directed Graphs. 511-523 - Peter J. Nicholson:
Algebraic Theory of Finite Fourier Transforms. 524-547
Volume 5, Number 6, December 1971
- Rani Siromoney:
Finite-Turn Checking Automata. 549-559 - Terrence W. Pratt:
Pair Grammars, Graph Languages and String-to-Graph Translations. 560-595 - Karel Culík II:
Abstract Families of Relations. 596-606 - Trevor I. Fenner, George Loizou:
On Fully Indecomposable Matrices. 607-622 - Thomas J. Ostrand:
Pattern Reproduction in Tessellation Automata of Arbitrary Dimension. 623-628 - I. P. McWhirter:
Substitution Expressions. 629-637
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-04 01:28 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:
