External Links

    Journal: J. Comput. Syst. Sci.

    Volume 5, Issue 6

    549 -- 559Rani Siromoney. Finite-Turn Checking Automata
    560 -- 595Terrence W. Pratt. Pair Grammars, Graph Languages and String-to-Graph Translations
    596 -- 606Karel Culik II. Abstract Families of Relations
    607 -- 622Trevor I. Fenner, George Loizou. On Fully Indecomposable Matrices
    623 -- 628Thomas J. Ostrand. Pattern Reproduction in Tessellation Automata of Arbitrary Dimension
    629 -- 637I. P. McWhirter. Substitution Expressions

    Volume 5, Issue 5

    455 -- 464Serafino Amoroso, Gerald Cooper. Tessellation Structures for Reproduction of Arbitrary Patterns
    465 -- 474Jerzy W. Grzymala-Busse. Operation-Preserving Functions and Autononous Factors of Finite Automata
    475 -- 488Arthur C. Fleck. Towards a Theory of Data Structures
    489 -- 510Gabor T. Herman. Every Finite Sequential Machine is Linearly Realizable
    511 -- 523F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli. Marked Directed Graphs
    524 -- 547Peter J. Nicholson. Algebraic Theory of Finite Fourier Transforms

    Volume 5, Issue 4

    337 -- 352György E. Révész. Unilateral Context Sensitive Grammars and Left-to-Right Parsing
    353 -- 364Jozef Gruska. A Characterization of Context-free Languages
    365 -- 396Seymour Ginsburg, Edwin H. Spanier. AFL with the Semilinear Property
    397 -- 429Ronald V. Book. Time-Bounded Grammars and Their Languages
    430 -- 452J. Ben Rosen. Minimum Error Bounds for Multidimensional Spline Approximation
    453 -- 0John Doner. Erratum: Tree Acceptors and Some of Their Applications

    Volume 5, Issue 3

    193 -- 238Arnold L. Rosenberg. Data Graphs and Addressing Schemes
    239 -- 253Zohar Manna. Mathematical Theory of Partial Correctness
    254 -- 285H. R. Strong Jr.. Translating Recursion Equations into Flow Charts
    286 -- 303Forbes D. Lewis. The Enumerability and Invariance of Complexity Classes
    304 -- 314Joseph S. Ullian. Three Theorems Concerning Principal AFLs
    315 -- 334Robert L. Constable. Subrecursive Programming Languages. II. On Program Size

    Volume 5, Issue 2

    83 -- 87Allen A. Goldstein, F. C. Johnson, Jürgen Spiess. On the Isolation of the Roots of a Non-Linear Operator
    88 -- 117Oscar H. Ibarra. Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata
    118 -- 128Giorgio Ausiello. Abstract Computational Complexity and Cycling Computations
    129 -- 162Izumi Kimura. Extensions of Asynchronous Circuits and the Delay Problem. Part II: Spike-Free Extensions and the Delay Problem of the Second Kind
    163 -- 191A. V. Balakrishnan. A Computational Approach to the Maximum Principle

    Volume 5, Issue 1

    1 -- 16Rina S. Cohen, Janusz A. Brzozowski. Dot-Depth of Star-Free Events
    17 -- 25Oliver Aberth. The Concect of Effective Method Applied to Computational Problems of Linear Algebra
    26 -- 40Jack W. Carlyle, Azaria Paz. Realizations by Stochastic Finite Automata
    41 -- 53Janusz A. Brzozowski, Karel Culik II, Armen Gabrielian. Classification of Noncounting Events
    54 -- 66Juris Hartmanis, Forbes D. Lewis. The use of Lists in the Study of Undecidable Problems in Automata Theory
    67 -- 82Erwin Engeler. Algorithmic Approximations
    runs on