%A Seymour Ginsburg
%A Michael A. Harrison
%T Bracketed context-free languages
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 1-23

%A R.S. Bucy
%T Linear positive machines
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 24-28

%A J.B. Rosen
%T Chebyshev solution of large linear systems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 29-43

%A K. Ritter
%T A parametric method for solving
certain nonconcave maximization problems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 44-54

%A Kenneth Krohn
%A Richard Mateosian
%A John Rhodes
%T Methods of the algebraic theory of machines
I. decomposition theorem for generalized machines;
properties preserved under series and parallel compositions of machines
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 55-85

%A E.K. Blum
%T Stationary points of functionals in pre-Hilbert spaces
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 86-90

%A A.V. Balakrishnan
%T Foundations of the state-space theory of continuous systems I
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 1
%D March 1967
%P 91-118

%A Kenneth Krohn
%A Rudolph Langer
%A John Rhodes
%T Algebraic principles for the analysis of a biochemical system
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 2
%D August 1967
%P 119-136

%A Yehoshafat Give'on
%T On some properties of the free monoids
with applications to automata theory
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 2
%D August 1967
%P 137-154

%A Juris Hartmanis
%A Wayne A. Davis
%T Homomorphic images of linear sequential machines
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 2
%D August 1967
%P 155-165

%A J.E. Hopcroft
%A J.D. Ullman
%T Nonerasing stack automata
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 2
%D August 1967
%P 166-186

%A Dana Scott
%T Some definitional suggestions for automata theory
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 2
%D August 1967
%P 187-212

%A G.B. Dantzig
%A R.M. van\ Slyke
%T Generalized upper bounding techniques
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 213-226

%A T. Guinn
%T Solutions of generalized optimization problems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 227-234

%A T. Guinn
%T First-order necessary conditions
for generalized optimization problems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 235-240

%A K. Ritter
%T A decomposition method for structured quadratic programming problems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 241-260

%A E.I. Axelband
%T A solution to the optimal pursuit problem
for distributed parameter systems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 261-286

%A Leonard Kleinrock
%A Edward G. Coffman
%T Distribution of attained service in time-shared systems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 287-298

%A Arnold L. Rosenberg
%T Multitape finite automata with rewind instructions
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 3
%D October 1967
%P 299-316

%A J.W. Thatcher
%T Characterizing derivation trees of context-free grammars
through a generalization of finite automata theory
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 317-322

%A E.J. Beltrami
%T On infinite-dimensional convex programs
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 323-329

%A D. Eggert
%A P. Varaiya
%T Affine dynamical systems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 330-348

%A R.S. Bucy
%T Global theory of the Riccati equation
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 349-361

%A E.K. Blum
%T The computation of eigenvalues and eigenvectors
of a completely continuous self-adjoint operator
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 362-370

%A A. Paz
%T Fuzzy star functions, probabilistic automata,
and their approximation by nonprobabilistic automata
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 371-390

%A A.V. Balakrishnan
%A J.L. Lions
%T State estimation for infinite-dimensional systems
%J Journal of Computer and System Sciences
%K jcss
%V 1
%N 4
%D December 1967
%P 391-403

%A J.E. Hopcroft
%A J.D. Ullman
%T Deterministic stack automata and the quotient operator
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 1
%D June 1968
%P 1-12

%A Eric G. Wagner
%T Bounded action machines:
toward an abstract theory of computer structure
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 1
%D June 1968
%P 13-75

%A Alan Schumitzky
%T On the equivalence between
matrix Riccati equations and Fredholm resolvents
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 1
%D June 1968
%P 76-87

%A Patrick C. Fischer
%A Arnold L. Rosenberg
%T Multitape one-way nonwriting automata
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 1
%D June 1968
%P 88-101

%A A.V. Balakrishnan
%T A new computing technique in system identification
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 1
%D June 1968
%P 102-116

%A J. Hartmanis
%T Tape-reversal bounded Turing machine computations
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 117-135

%A Patrick C. Fischer
%T The reduction of tape reversals for off-line one-tape Turing machines
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 136-147

%A Gene F. Rose
%T Closures which preserve finiteness in families of languages
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 148-168

%A Ronald Alter
%T On the nonexistence of
close-packed double Hamming-error-correcting codes on q=7 symbols
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 169-176

%A H.A. Antosiewitz
%T Newton's method and boundary value problems
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 177-202

%A Roy Danchick
%T Further results on generalized predictor-corrector methods
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 2
%D August 1968
%P 203-218

%A David E. Muller
%A Gianfranco R. Putzolu
%T Frequency of decomposability
among machines with a large number of states
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 219-227

%A Seymour Ginsburg
%A Edwin H. Spanier
%T Derivation-bounded languages
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 228-250

%A Izumi Kimura
%T Extensions of synchronous circuits and the delay problem
I. good extensions and the delay problem of the first kind
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 251-287

%A Austin Blaquiere
%A Francoise Gerard
%T On the geometry of optimal strategies in two-person games of kind
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 288-304

%A Roger J.-B. Wets
%A David W. Walkup
%T A note on decision rules for stochastic programs
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 305-311

%A Gianfranco R. Putzolu
%T Probabilistic aspects of machine decomposition theory
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 3
%D October 1968
%P 312-332

%A L. Collatz
%T Multiparametric eigenvalue problems in inner-product spaces
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 333-341

%A Vladimir F. Demjanov
%T Algorithms for some minimax problems
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 342-380

%A H. Gallaire
%A J.N. Gray
%A M.A. Harrison
%A G.T. Herman
%T Infinite linear sequential machines
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 381-419

%A J.R.H. Dempster
%T On the multiplying ability of two-way automata
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 420-426

%A Marvin C. Paull
%A Stephen H. Unger
%T Structural equivalence of context-free grammars
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 427-463

%A Dennis Allen,\ Jr.
%T On a characterization of the nonregular set of primes
%J Journal of Computer and System Sciences
%K jcss
%V 2
%N 4
%D December 1968
%P 464-467

%A A. Pasquali
%T On the convergence of nonlinear simultaneous displacements
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 1-7

%A Melvin A. Breuer
%T Combinatorial equivalence of (0,1) circular matrices
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 8-23

%A Y. Yavin
%T Optimal control for a class of distributed parameter systems
where the cost functions are norms
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 24-36

%A A.V. Aho
%A J.D. Ullman
%T Syntax directed translations and the pushdown assembler
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 37-56

%A Lucien W. Neustadt
%T A general theory of extremals
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 57-92

%A D.R. Deuel
%T Time-varying linear sequential machines I
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 1
%D February 1969
%P 93-118

%A Zohar Manna
%T The correctness of programs
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 119-127

%A Arthur R. Butz
%T Convergence with Hilbert's space filling curve
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 128-146

%A Richard M. Karp
%A Raymond E. Miller
%T Parallel program schemata
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 147-195

%A Sheila Greibach
%T Checking automata and one-way stack languages
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 196-217

%A J.E. Dennis
%A A.A. Goldstein
%T Cubature and Tchakaloff cone
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 218-220

%A Ryuichi Ito
%T Every semilinear set is a finite union of disjoint linear sets
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 2
%D May 1969
%P 221-232

%A Sheila Greibach
%A John Hopcroft
%T Scattered context grammars
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 3
%D August 1969
%P 233-247

%A E.K. Blum
%T Towards a theory of semantics and compilers for programming languages
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 3
%D August 1969
%P 248-275

%A George Mager
%T Writing pushdown acceptors
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 3
%D August 1969
%P 276-318

%A A.V. Aho
%A J.D. Ullman
%T Properties of syntax directed translations
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 3
%D August 1969
%P 319-334

%A M.D. Grigoriadis
%A K. Ritter
%T A decomposition method for structured linear and nonlinear programs
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 335-360

%A Donald M. Kaplan
%T Regular expressions and the equivalence of programs
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 361-386

%A Alfred H. Morris,\ Jr.
%T Elementary indefinite integration theory for the computer
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 387-408

%A Masaharu Mizumoto
%A Junichi Toyoda
%A Kohkichi Tanaka
%T Some considerations on fuzzy automata
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 409-422

%A R.M. Baer
%A E.H. Spanier
%T Referenced automata and metaregular families
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 423-446

%A John Cleave
%T The primitive recursive analysis of ordinary differential equations
and the complexity of their solutions
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 447-455

%A Ben Wegbreit
%T A generator of context-sensitive languages
%J Journal of Computer and System Sciences
%K jcss
%V 3
%N 4
%D November 1969
%P 456-461

%A H.R. Strong
%T Depth-bounded computation
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 1-14

%A Herbert B. Keller
%T Newton's method under mild differentiability conditions
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 15-28

%A A.A. Goldstein
%A J.S. Meditch
%T Nonlinear optimal controls
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 29-37

%A R. Conti
%T A convex programming problem in Banach spaces
and applications to optimum control theory
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 38-49

%A Patrick C. Fischer
%A Albert R. Meyer
%A Arnold L. Rosenberg
%T Time-restricted sequence generation
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 50-73

%A R.J. Orgass
%T Some results concerning proofs of statements about programs
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 74-88

%A R.J. Oscar
%T Some results concerning proofs of statements about programs
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 1
%D February 1970
%P 89-92

%A Franco P. Preparata
%A David E. Muller
%T Generation of near-optimal universal boolean functions
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 2
%D April 1970
%P 93-102

%A Alex McNabb
%A Alan Schumitzky
%T Factorization of operators II:
a nonlinear Volterra method for numerical solution
of linear Fredholm equations
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 2
%D April 1970
%P 103-128

%A A.V. Aho
%A J.D. Ullman
%A J.E. Hopcroft
%T On the computational power of pushdown automata
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 2
%D April 1970
%P 129-136

%A H. Yamada
%A S. Amoroso
%T A completeness problem for pattern generation in tessalation automata
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 2
%D April 1970
%P 137-176

%A Walter J. Savitch
%T Relationships between nondeterministic and deterministic
tape complexities
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 2
%D April 1970
%P 177-192

%A Gene F. Rose
%T Abstract families of processors
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 193-204

%A R. Milner
%T Equivalences on program schemes
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 205-219

%A D.C. Luckham
%A D.M.R. Pare
%A M.S. Paterson
%T On formalised computer programs
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 220-249

%A R. Temam
%T Remarks on the approximation of some nonlinear elliptic equations
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 250-259

%A Rina S. Cohen
%A J.A. Brzozowski
%T General properties of star height of regular events
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 260-280

%A Rina S. Cohen
%T Star height of regular events
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 3
%D June 1970
%P 281-298

%A L.Y. Liu
%A P. Weiner
%T A characterization of semilinear sets
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 4
%D August 1970
%P 299-307

%A Seymour Ginsburg
%A Sheila Greibach
%T Principal AFL
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 4
%D August 1970
%P 308-338

%A James W. Thatcher
%T Generalized sequential machine maps
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 4
%D August 1970
%P 339-367

%A J. Hartmanis
%A J.E. Hopcroft
%T What makes some language theory problems undecidable
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 4
%D August 1970
%P 368-376

%A Ramon E. Moore
%T On the stability of linear recurrence equations
with arbitrary time lags
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 4
%D August 1970
%P 377-384

%A William Bridges Smith
%T Error detection in formal languages
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 385-405

%A John Doner
%T Acceptors and some of their applications
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 406-451

%A Sanat K. Basu
%T On the structure of subrecursive degrees
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 452-464

%A Webb Miller
%T Recursive function theory and numerical analysis
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 465-472

%A Edward Angel
%T Invariant imbedding, difference equations,
and elliptic boundary value problems
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 473-491

%A Takumi Kasal
%T An hierarchy between context-free and context-sensitive languages
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 5
%D October 1970
%P 492-508

%A A.L. Perrie
%T Uniform rational approximation with osculatory interpolation
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 509-522

%A A.V. Aho
%A J.D. Ullman
%T A characterization of two-way deterministic classes of languages
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 523-538

%A Y. Give'on
%A Y. Zalcstein
%T Algebraic structures in linear systems theory
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 539-556

%A Yoshiyuki Sakawa
%T An application of the epsilon technique
to the solution of pursuit and evasion problems
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 557-569

%A Kailish C. Kapur
%A Richard M. van\ Slyke
%T Cutting plane algorithms and state space constrained
linear optimal control problems
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 570-605

%A Ronald V. Book
%A Sheila A. Greibach
%A Ben Wegbreit
%T Time- and tape-bounded Turing acceptors and AFLs
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 606-621

%A Ronald V. Book
%A Sheila A. Greibach
%A Oscar H. Ibarra
%A Ben Wegbreit
%T Tape-bounded Turing acceptors and principal AFLs
%J Journal of Computer and System Sciences
%K jcss
%V 4
%N 6
%D December 1970
%P 622-625

%A Rina S. Cohen
%A J.A. Brzozowski
%T Dot-depth of star-free events
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 1-16

%A Oliver Aberth
%T The concept of effective method
applied to computational problems of linear algebra
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 17-25

%A J.W. Carlyle
%A A. Paz
%T Realizations by stochastic finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 26-40

%A J.A. Brzozowski
%A K. Culik,\ II
%A A. Gabriellian
%T Classification of non-counting events
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 41-53

%A J. Hartmanis
%A F.D. Lewis
%T The use of lists in the study
of undecidable problems in automata theory
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 54-66

%A Erwin Engeler
%T Algorithmic approximations
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 1
%D February 1971
%P 67-82

%A A.A. Goldstein
%A F.C. Johnson
%A Hurgen Spiess
%T On the isolation of the roots of a non-linear operator
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 83-87

%A Oscar H. Ibarra
%T Characterization of some tape and time complexity classes
of Turing machines in terms of multihead and auxiliary stack automata
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 88-117

%A Giorgio Ausiello
%T Abstract computational complexity and cycling computations
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 118-128

%A Izumi Kimura
%T Extensions of asynchronous circuits and the delay problem
part II: spike-free extensions and the delay problem of the second kind
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 129-162

%A A.V. Balakrishnan
%T A computational approach to the maximum principle
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 163-192

%A Arnold L. Rosenberg
%T Data graphs and addressing schemes
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 2
%D April 1971
%P 193-238

%A Zohar Mann
%T Mathematical theory of partial correctness
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 3
%D June 1971
%P 239-253

%A H.R. Strong,\ Jr.
%T Translating recursion equations into flow charts
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 3
%D June 1971
%P 254-285

%A F.D. Lewis
%T The enumerability and invariance of complexity classes
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 3
%D June 1971
%P 286-303

%A J.S. Ullian
%T Three theorems concerning principal AFLs
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 3
%D June 1971
%P 304-314

%A Robert L. Constable
%T Subrecursive programming languages II. on program size
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 3
%D June 1971
%P 315-334

%A Gyorgy Revesz
%T Unilateral context sensitive grammars and left-to-right parsing
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 4
%D August 1971
%P 337-352

%A Jozef Gruska
%T A characterization of context-free languages
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 4
%D August 1971
%P 353-364

%A Seymour Ginsburg
%A Edwin H. Spanier
%T AFL with the semilinear property
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 4
%D August 1971
%P 365-396

%A Ronald V. Book
%T Time-bounded grammars and their languages
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 4
%D August 1971
%P 397-429

%A J.B. Rosen
%T Minimum error bounds for multidimensional spline approximation
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 4
%D August 1971
%P 430-452

%A Serafino Amoroso
%A Gerald Cooper
%T Tessalation structures for reproduction of arbitrary patterns
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 455-464

%A Jerzy W. Grzymala-Busse
%T Operation-preserving functions and autonomous factors
of finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 465-474

%A A.C. Fleck
%T Towards a theory of data structures
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 475-488

%A G.T. Herman
%T Every finite sequential machine is linearly realizable
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 489-510

%A F. Commoner
%A A.W. Holt
%A S. Even
%A A. Pnueli
%T Marked directed graphs
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 511-523

%A Peter J. Nicholson
%T Algebraic theory of finite Fourier transforms
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 5
%D October 1971
%P 524-548

%A Rani Siromoney
%T Finite-turn checking automata
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 549-559

%A Terence W. Pratt
%T Pair grammars, graph languages and string-to-graph translations
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 560-595

%A Karel Culik,\ II
%T Abstract families of relations
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 596-606

%A Trevor I. Fenner
%A Georghios Loizou
%T On fully indecomposable matrices
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 607-622

%A Thomas J. Ostrand
%T Pattern reproduction in tessalation automata of arbitrary dimension
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 623-628

%A I.P. McWhirter
%T Substitution expressions
%J Journal of Computer and System Sciences
%K jcss
%V 5
%N 6
%D December 1971
%P 629-637

%A Lee E. Heindel
%T Computation of powers of multivariate polynomials over the integers
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 1
%D February 1972
%P 1-8

%A Jonathan Goldstine
%T Substitution and bounded languages
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 1
%D February 1972
%P 9-29

%A Sheila A. Greibach
%T Syntactic operators on full semiAFLs
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 1
%D February 1972
%P 30-76

%A Andy N.C. Kang
%T Effective operators with no strong gaps
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 1
%D February 1972
%P 77-87

%A V.E. Itkin
%A Z. Zwinogrodzki
%T On program schemata equivalence
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 1
%D February 1972
%P 88-102

%A David Gale
%A Richard M. Karp
%T A phenomenon in the theory of sorting
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 103-115

%A Michael S. Paterson
%T Tape bounds for time-bounded Turing machines
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 116-124

%A A.V. Aho
%A J.D. Ullman
%T Equivalence of programs with structured variables
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 125-137

%A T. Kaneda
%T Pushdown automata with counters
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 138-150

%A Yechezkel Zalcstein
%T Locally testable languages
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 151-167

%A Joseph Alphonso Guiliano
%T Writing stack acceptors
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 2
%D April 1972
%P 168-204

%A P.M. Spira
%T Complete linear proofs of linear inequalities
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 205-216

%A Donald F. Stanat
%T A homomorphism theorem for weighted context-free grammars
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 217-232

%A Alvy Ray Smith,\ III
%T Real-time language recognition by one-dimensional cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 233-253

%A J.P. Cleave
%T Combinatorial systems I. cylindrical problems
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 254-266

%A Jurgen Eickel
%A Jacques Loeckx
%T The relation between derivations and syntactical structures
in phrase-structure grammars
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 267-282

%A Philippe Butzbach
%T Les 1-convexes du monoide commutatif N^n
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 3
%D June 1972
%P 283-289

%A Michael A. Golberg
%T The equivalence of several initial value methods
for solving integral equations
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 291-297

%A Martin H. Schultz
%T Tchebycheff approximation for multivariate splines
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 298-304

%A James C. King
%A Robert W. Floyd
%T An interpretation-oriented theorem prover over integers
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 305-323

%A Vaclav Rajlich
%T Absolutely parallel grammars and two-way finite state transducers
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 324-342

%A R.S Bucy
%T The Riccati equation and its bounds
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 343-353

%A Steve F. McCormick
%T A general approach to one-step iterative methods
- with application to eigenvalue problems
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 4
%D August 1972
%P 354-372

%A D. Richardson
%T Tessalation with local transformations
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 373-388

%A H.B. Enderton
%T Degrees of computational complexity
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 389-396

%A F.P. Preparata
%A R.T. Yeh
%T Continuously valued logic
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 397-418

%A D.E. Muller
%A R.E. Muller
%T A generalization of the theory of incompletely specified machines
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 419-447

%A S. Amoroso
%A Y.N. Patt
%T Decision procedures for surjectivity and injectivity
of parallel maps for tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 448-464

%A Jacob Katzenelson
%T The Markov algorithm as a language parser-linear bounds
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 5
%D October 1972
%P 465-478

%A R.L. Constable
%A S.S. Muchnick
%T Subrecursive program schemata I & II
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 490-537

%A David S. Wise
%T Generalized overlap resolvable grammars and their parsers
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 538-572

%A A.V. Aho
%A J.D. Ullman
%T Optimization of LR(k) parsers
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 573-602

%A Michael Machtey
%T Augmented loop languages and classes of computable functions
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 603-624

%A Ian Munro
%A Allan Borodin
%T Efficient evaluation of polynomial forms
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 625-638

%A Michael O. Rabin
%T Proving simultaneous positivity of linear forms
%J Journal of Computer and System Sciences
%K jcss
%V 6
%N 6
%D December 1972
%P 639-650

%A Seymour Ginsburg
%A Sheila A. Greibach
%T On AFL generators for finitely encoded AFA
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 1
%D February 1973
%P 1-27

%A Oscar H. Ibarra
%T On two-way multihead automata
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 1
%D February 1973
%P 28-36

%A Norihiro Abe
%A Masaharu Mizumoto
%A Jun-ichi Toyoda
%A Kohkichi Tanaka
%T Web grammars and several graphs
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 1
%D February 1973
%P 37-65

%A Karel Culik,\ II
%A Rina Cohen
%T LR-regular grammars - and extension of LR(k) grammars
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 1
%D February 1973
%P 66-96

%A Horacio Feliciangeli
%A Gabor T. Herman
%T Algorithms for producing grammars from sample derivations:
a common problem of formal language theory and developmental biology
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 1
%D February 1973
%P 97-118

%A Stephen J. Garland
%A David C. Luckham
%T Program schemes, recursion schemes, and formal languages
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 2
%D April 1973
%P 119-160

%A Bernard P. Zeigler
%T Every discrete input machine is linearly simulatable
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 2
%D April 1973
%P 161-167

%A J. Hartmanis
%A H. Walter
%T Group theoretic characterization of linear permutation automata
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 2
%D April 1973
%P 168-188

%A Ian Munro
%A Michael Paterson
%T Optimal algorithms for parallel polynomial polynomial evaluation
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 2
%D April 1973
%P 189-198

%A Yoshihide Igarashi
%A Namio Honda
%T On the extension of Gladkij's theorem
and the hierarchies of languages
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 2
%D April 1973
%P 199-217

%A Michael A. Harrison
%A Ivan M. Havel
%T Strict deterministic grammars
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 237-277

%A Michael A. Arbib
%T Coproducts and decomposable machines
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 278-287

%A Zvi Kohavi
%A Joseph Winograd
%T Establishing certain bounds concerning finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 288-299

%A Yoshifumi Masunaga
%A Shoichi Noguchi
%A Juro Oizumi
%T A structure theory of automata characterized by groups
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 300-305

%A To-yat Cheung
%T Approximate solutions and error bounds
for quasilinear elliptic boundary value problems
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 306-322

%A J.E. Hopcroft
%A R.E. Tarjan
%T A V log V algorithm for isomorphism of triconnected planar graphs
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 3
%D June 1973
%P 323-332

%A H.T. Kung
%T A bound on the multiplicative efficiency of iteration
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 334-342

%A Stephen A. Cook
%T A hierarchy for nondeterministic time complexity
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 343-353

%A Stephen A. Cook
%A Robert A. Reckhow
%T Time bounded random access machines
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 354-375

%A C.P. Schnorr
%T Process complexity and effective random tests
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 376-388

%A Walter J. Savitch
%T Maze recognizing automata and nondeterministic tape complexity
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 389-403

%A S.A. Walker
%A H.R. Strong
%T Characterizations of flowchartable recursions
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 404-447

%A Manuel Blum
%A Robert W. Floyd
%A Vaughan Pratt
%A Ronald L. Rivest
%A Robert E. Tarjan
%T Time bounds for selection
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 4
%D August 1973
%P 448-462

%A Meera Blattner
%T The unsolvability of the equality problem
for sentential forms of context-free grammars
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 463-468

%A Ellis Horowitz
%T The efficient calculation of powers of polynomials
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 469-480

%A Takeo Yaku
%T The constructibility of a configuration in a cellular automaton
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 481-496

%A C.E. Hughes
%T Many-one degrees associated with semi-Thue systems
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 497-505

%A Alan G. Konheim
%A Bernd Meister
%T Distributions of queue lengths and waiting times
in a loop with two-way traffic
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 506-521

%A Svetlana P. Kartashev
%T State assignments for realizing
modular input-free sequential logical networks without invertors
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 5
%D October 1973
%P 522-542

%A J.D. Rutledge
%T Program schemata as automata I
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 6
%D December 1973
%P 543-578

%A Robert D. Rosebrugh
%A Derick Wood
%T A characterization theorem for n-parallel right linear languages
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 6
%D December 1973
%P 579-582

%A L. Boasson
%T Two iteration theorems for some families of languages
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 6
%D December 1973
%P 583-596

%A D. Nudds
%T Conversion of programs between computers:
interpreters, simulators and compilers
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 6
%D December 1973
%P 597-614

%A Akihiro Nozaki
%T Two entropies of a generalized sorting problem
%J Journal of Computer and System Sciences
%K jcss
%V 7
%N 6
%D December 1973
%P 615-621

%A S.J. Walljasper
%T Left-derivation bounded languages
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 1-7

%A Johnson Murdoch Hart
%T Ambiguity and decision problems for local adjunct languages
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 8-21

%A Richard Bird
%T On transformations of programs
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 22-35

%A J.P. Crestin
%T Structure des grammaires d'ambiguite bornee
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 36-40

%A Ratan K. Guha
%A Raymound T. Yeh
%T On periodicity of sequential machines
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 41-70

%A Harry R. Lewis
%T Program schemata and the first-order decision problem
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 71-83

%A Toshihide Ibaraki
%T Classes of discrete optimization problems and their decision problems
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 1
%D February 1974
%P 84-116

%A Yaacov Choueka
%T Theories of automata on omega-tapes: a simplified approach
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 117-141

%A Nabil A. Khabbaz
%T A geometric hierarchy of languages
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 142-157

%A A.B. Cremers
%A O. Mayer
%T On vector languages
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 158-166

%A Yoshide Igarashi
%A Namio Honda
%T Deterministic multitape automata computations
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 167-189

%A Patrick C. Fischer
%A John C. Warkentin
%T Predecessor machines
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 190-219

%A E.K. Blum
%A C. Rodrigue
%T Solution of eigenvalue problems in Hilbert spaces
by a gradient method
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 220-237

%A Gyorgy Revesz
%T Comment on the paper "Error detection in formal languages"
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 238-242

%A Seymour Ginsburg
%A Gene F. Rose
%T The equivalence of stack counter acceptors
and quasi-realtime acceptors
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 2
%D April 1974
%P 243-270

%A David S. Johnson
%T Fast algorithms for bin packing
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 272-314

%A Brenda S. Baker
%A Ronald V. Book
%T Reversal-bounded multipushdown machines
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 315-332

%A J.A. Goguen,\ Jr.
%T On homomorphisms, correctness, termination, unfoldments,
and equivalence of flow diagram programs
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 333-365

%A A. Borodin
%A R. Moenck
%T Fast modular transforms
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 366-386

%A A.J. Kfoury
%T Translatability of schemas over restricted interpretations
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 387-408

%A T.S.E. Maibaum
%T A generalized approach to formal languages
%J Journal of Computer and System Sciences
%K jcss
%V 8
%N 3
%D June 1974
%P 409-439

%A Arthur Gill
%A Lawrence T. Kou
%T Multiple-entry finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 1-19

%A Gerard G.L. Meyer
%T Algorithm model for penalty functions-type iterative procedures
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 20-30

%A Akira Maruoka
%A Masayuki Kimura
%T Completeness problem of
one-dimensional binary scope-3 tessalation automata
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 31-47

%A Eugene M. Norris
%T Difunctionally induced state machines
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 48-55

%A Kai Hwang
%T Cyclic decomposition of finite stochastic systems
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 56-68

%A Seymour Ginsburg
%A Edwin H. Spanier
%T On incomparable abstract family of languages (AFL)
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 88-108

%A Lee E. Heindel
%T Congruence arithmetic algorithms
for polynomial real zero determination
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 1
%D August 1974
%P 109-128

%A Yves Rouchaleau
%A Bostwick F. Wyman
%T Linear dynamical systems over integral domains
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 129-142

%A Nancy Lynch
%T Approximations to the halting problem
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 143-150

%A R.P. Daley
%T The extent and density of sequences
within the minimal-program complexity hierarchies
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 151-163

%A S. Rao Kosaraju
%T 1-way stack automaton with jumps
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 164-176

%A Takumi Kasai
%T Translatability of flowcharts into while programs
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 177-195

%A Peter Elias
%T Minimum times and memories needed to compute the values of a function
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 196-212

%A Ronald V. Book
%T Comparing complexity classes
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 2
%D October 1974
%P 213-230

%A S. Rao Kosaraju
%T Analysis of structured programs
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 232-255

%A David S. Johnson
%T Approximation algorithms for combinatorial problems
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 256-278

%A P.M. Lewis
%A D.J. Rosenkrantz
%A R.E. Stearns
%T Attributed translations
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 279-307

%A Stephen A. Cook
%T An observation on time-storage trade off
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 308-316

%A Michael J. Fischer
%A Larry J. Stockmeyer
%T Fast on-line integer multiplication
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 317-331

%A Jean Vuillemin
%T Correct and optimal implementations of recursion
in a simple programming language
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 332-354

%A R. Endre Tarjan
%T Testing flow graph reducibility
%J Journal of Computer and System Sciences
%K jcss
%V 9
%N 3
%D December 1974
%P 355-365

%A J.A. Goguen
%T Discrete-time machines in closed monoidal categories I
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 1-43

%A Victor Harnik
%T Effective proper procedures and universal classes of program schemata
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 44-61

%A I.H. Sudborough
%T On tape-bounded complexity classes and multihead finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 62-76

%A Serafino Amoroso
%A Gerald Cooper
%A Yale Patt
%T Some clarifications of the concept of a Garden-of-Eden configuration
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 77-82

%A James C. Woings,\ Jr.
%T Splitting a context-sensitive set
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 83-87

%A Donald J. Kiel
%T Two-way A-transducers and AFL
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 88-109

%A E.A. Ashcroft
%T Proving assertions about parallel programs
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 110-135

%A Aravind K. Joshi
%A Leon S. Levy
%A Msako Takahashi
%T Tree adjunct grammars
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 1
%D February 1975
%P 136-164

%A Seymour Ginsburg
%A Jonathan Goldstine
%A Sheila Greibach
%T Uniformly erasable AFL
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 165-182

%A Michael Machtey
%T On the density of honest subrecursive classes
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 183-199

%A Kenneth B. Salomon
%T The decidability of a mapping problem
for generalized sequential machines with final states
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 200-218

%A M. Mizumoto
%A J. Toyoda
%A K. Tanaka
%T Various kinds of automata with weights
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 219-236

%A S.A. Greibach
%T One counter languages and the IRS condition
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 237-247

%A Wallace L. Hamilton
%A John R. Mertens,\ Jr.
%T Reproduction in tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 248-252

%A Akira Nakamura
%T On causal omega^2-systems
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 253-265

%A Suad Alagic
%T Natural state transformations
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 266-307

%A Leslie G. Valiant
%T General context-free recognition in less than cubic time
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 2
%D April 1975
%P 308-316

%A C. Beeri
%T Two-way nested stack automata
are equivalent to two-way stack automata
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 317-339

%A Leslie G. Valiant
%A Michael S. Paterson
%T Deterministic one-counter automata
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 340-350

%A Jonathan Goldstine
%T Some independent families of one-letter languages
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 351-369

%A G. Germano
%A A. Maggiolo-Schettini
%T Proving a compiler correct: a simple approach
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 370-383

%A J.D. Ullman
%T NP-complete scheduling problems
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 384-393

%A Sister Teresemarie-McCloskey
%T Abstract families of length-preserving processors
%J Journal of Computer and System Sciences
%K jcss
%V 10
%N 3
%D June 1975
%P 394-427

%A Branislav Rovan
%T Proving containment of bounded AFL
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 1-55

%A Oscar H. Ibarra
%A Sartaj K. Sahni
%T Hierarchies of Turing machines with restricted tape alphabet size
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 56-67

%A Neil D. Jones
%T Space-bounded reducibility among combinatorial problems
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 68-85

%A Armin Cremers
%A Seymouy Ginsburg
%T Context-free grammar forms
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 86-117

%A A.R. Freedman
%A R.E. Ladner
%T Space bounds for processing contentless inputs
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 118-128

%A G. Rozenberg
%A K.P. Lee
%T Some properties of the class of L languages with interactions
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 1
%D August 1975
%P 129-148

%A Hidenosuki Nishio
%A Youichi Kobuchi
%T Fault tolerant cellular spaces
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 150-170

%A Masateru Harao
%A Shoichi Noguchi
%T Fault tolerant cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 171-185

%A Vaclav Rajlich
%T Dynamics of discrete systems and pattern reproduction
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 186-202

%A Jan van\ Leeuwen
%T The tape-complexity of context-independent developmental languages
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 203-211

%A Hartmut Ehrig
%A Karl Wilhelm Tischer
%T Graph grammars and applications
to specialization and evolution in biology
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 212-236

%A W.O. Hollerer
%A R. Vollmar
%T On "forgetful" cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 237-251

%A Adrian Walker
%T Formal grammars and the regeneration capability of biological systems
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 252-261

%A Ann Reedy
%A Walter J. Savitch
%T Ambiguity in the developmental systems of Lindenmayer
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 2
%D October 1975
%P 262-284

%A Rob M. Baer
%T Computation by assembly
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 285-294

%A Michael J. Best
%A Klaus Ritter
%T An accelerated conjugate direction method
to solve linearly constrained minimization problems
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 295-322

%A J.W. de\ Bakker
%A L.G.L.T. Meertens
%T On the completeness of the inductive assertion method
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 323-357

%A Barry K. Rosen
%T Program equivalence and context-free grammars
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 358-374

%A Eduardo D. Sontag
%T On some questions of rationality and decidability
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 375-381

%A S. di Gregorio
%A G. Trautteur
%T On reversibility in cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 382-391

%A Andrzej Ehrenfeucht
%T Practical decidability
%J Journal of Computer and System Sciences
%K jcss
%V 11
%N 3
%D December 1975
%P 392-397

%A Takeo Yaku
%T Surjectivity of nondeterministic parallel maps
induced by nondeterministic cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 1-5

%A D. Richardson
%T Continuous self-reproduction
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 6-12

%A F. Joanne Helton
%T The semigroup of an algebra automaton
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 13-24

%A Sam Savage
%A Peter Weiner
%A A. Bagchi
%T Neighborhood search algorithms
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 25-35

%A Masakazu Nasu
%A Namio Honda
%T A completeness property of one-dimensional tessalation automata
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 36-48

%A Yoshinori Ezawa
%A Masaharu Mizumoto
%A Junishi Toyoda
%A Kokichi Tanaka
%T Interactive languages
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 49-63

%A Johnson M. Hart
%T The derivation language of a phrase structure grammar
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 64-79

%A Klaus Weihrauch
%T The computational complexity of program schemata
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 80-107

%A R.R. Meyer
%T Sufficient conditions for the convergence
of monotonic mathematical programming algorithms
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 108-121

%A F.D. Lewis
%T On computational reducibility
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 1
%D February 1976
%P 122-132

%A Andrzej Ehrenfeucht
%A Paul Zeiger
%T Complexity measures for regular expressions
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 2
%D April 1976
%P 134-146

%A Kurt Mehlhorn
%T Polynomial and abstract subrecursive classes
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 2
%D April 1976
%P 147-178

%A Bruno Courcelle
%A Jean Vuillemin
%T Completeness results for the equivalence of recursive schemas
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 2
%D April 1976
%P 179-197

%A Vaughan R. Pratt
%A Larry J. Stockmeyer
%T A characterization of the power of vector machines
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 2
%D April 1976
%P 198-221

%A Harry B. Hunt,\ III
%A Daniel J. Rosenkrantz
%A Thomas G. Szymanski
%T On the equivalence, containment, and covering problems
for the regular and context-free languages
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 2
%D April 1976
%P 222-268

%A Hartmut Ehrig
%A Hans-Jorg Kreowski
%T Systematic approach to reduction and minimization
in automata and system theory
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 269-304

%A Stephen L. Bloom
%A Calvin C. Elgot
%T The existence and construction of free iterative theories
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 305-318

%A J. Bruno
%A E.G. Coffman,\ Jr.
%A D.B. Johnson
%T On batch scheduling of jobs
with stochastic service times and cost structures on a single server
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 319-335

%A Y. Breitbart
%T Some bounds on the complexity of predicate recognition
by finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 336-349

%A Zvi Galil
%A Janos Simon
%T A note on multiple-entry finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 350-351

%A K. Hashiguchi
%A N. Honda
%T Properties of code events and homomorphisms over regular events
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 352-367

%A Donald A. Alton
%T Nonexistence of program optimizers in several abstract settings
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 368-393

%A Peter Gordon Anderson
%T Another proof of the theorem
on pattern reproduction in tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 394-398

%A J. Goldstine
%T Bounded AFLs
%J Journal of Computer and System Sciences
%K jcss
%V 12
%N 3
%D June 1976
%P 399-419

%A James L. Peterson
%T Computation sequence nets
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 1-24

%A Stephen Cook
%A Ravi Sethi
%T Storage requirements
for deterministic polynomial time recognizable languages
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 25-37

%A Kenichi Taniguchi
%A Tadao Kasami
%T A result on the equivalence problem
for deterministic pushdown automata
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 38-50

%A Patrick C. Fischer
%A Edward L. Robertson
%A Lawrence V. Saxton
%T On the sequential nature of functions
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 51-68

%A David Dorkin
%T A nonlinear lower bound on linear search tree programs
for solving knapsack programs
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 69-73

%A Yoshifumi Masunaga
%A Shoichi Noguchi
%A Juro Oizumi
%T A characterization of automata and a direct product decomposition
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 74-89

%A G. Rozenberg
%A A. Salomaa
%T Context-free grammar s with graph-controlled tables
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 90-99

%A Nancy Lynch
%T Complexity-class-encoding sets
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 1
%D August 1976
%P 100-118

%A Robert M. Baer
%A Jan van\ Leeuwen
%T The halting problem for linear Turing assemblers
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 119-135

%A Serafino Amoroso
%A Irving J. Epstein
%T Indecomposable parallel maps in tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 136-142

%A Yokio Shibata
%T On the structure of Abelian automata
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 143-152

%A Oscar H. Ibarra
%A Chul E. Kim
%T A useful device for showing the solvability of some decision problems
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 153-160

%A A. Nozaki
%T Hazard analysis of asynchronous circuits in Muller-Bartky's sense
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 161-171

%A Richard Laing
%T Automaton introspection
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 172-183

%A A. Schonhage
%A M. Paterson
%A N. Pippenger
%T Finding the median
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 184-199

%A Stephen L. Bloom
%T Varieties of ordered algebras
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 200-212

%A S.F. McCormick
%T Some convergence results on the method of gradients
for Ax = lambda Bx
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 213-222

%A Andre Arnold
%A Max Dauchet
%T Un theoreme de duplication pour les forets algebriques
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 2
%D October 1976
%P 223-244

%A C. Raymond Perault
%T Intercalation lemmas for tree transducer languages
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 246-277

%A Leslie G. Valiant
%T Graph-theoretic properties in computational complexity
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 278-285

%A A.V. Aho
%A J.D. Ullman
%T Node listings for reducible flow graphs
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 286-299

%A Gary L. Miller
%T Riemann's hypothesis and tests for primality
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 300-317

%A Harry B. Hunt,\ III
%A Thomas G. Szymanski
%T Complexity metatheorems for context-free grammar problems
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 318-334

%A Kellog S. Booth
%A George S. Lueker
%T Testing for the consecutive ones property,
interval graphs, and graph planarity using PQ-tree algorithms
%J Journal of Computer and System Sciences
%K jcss
%V 13
%N 3
%D December 1976
%P 335-379

%A Herbert Fleischner
%T On the equivalence of Mealy-type and Moore-type automata
and a relation between reducibility and Moore-reducibility
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 1-16

%A Kripasindhu Sikdar
%T On topological machines
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 17-48

%A R.J. Lipton
%A R.E. Miller
%A L. Snyder
%T Synchronization and computing capabilities
of linear asynchronous structures
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 49-72

%A Joel I. Seiferas
%T Techniques for separating space complexity classes
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 73-99

%A Joel I. Seiferas
%T Relating refined space complexity classes
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 100-129

%A V.J. Rayward-Smith
%T Hypergrammars: an extension of macrogrammars
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 130-149

%A D.J. Hartfiel
%A C.J. Maxson
%T A semigroup characterization
of a linearly realizable automaton over GF(p)
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 1
%D February 1977
%P 150-156

%A Arnold L. Rosenberg
%T On storing concatenable arrays
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 157-174

%A Garry Rodrigue
%T The method of closest approach
for finding nonisolated zeros of functions
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 175-186

%A Detlef Wotschke
%T Degree-languages: a new concept of acceptance
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 187-209

%A David Alan Plaisted
%T Sparse complex polynomials and polynomial reducibility
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 210-221

%A Ronald Fagin
%T Asymptotic miss ratios over independent references
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 222-250

%A Stephen L. Bllom
%A Susanna Ginall
%A Joseph D. Rudledge
%T Scalar and vector iteration
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 251-256

%A Tadashi Ae
%T Direct or cascade product of pushdown automata
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 2
%D April 1977
%P 257-264

%A Matthew M. Geller
%A Michael A. Harrison
%T Characteristic parsing: a framework
for producing compact deterministic parsers I
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 3
%D June 1977
%P 265-317

%A Matthew M. Geller
%A Michael A. Harrison
%T Characteristic parsing: a framework
for producing compact deterministic parsers II
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 3
%D June 1977
%P 318-343

%A Emily P. Friedman
%T Equivalence problems for deterministic context-free languages
and monadic recursion schemes
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 3
%D June 1977
%P 344-359

%A W.S. Ching
%A B.F. Wyman
%T Duality and the regulator problem
for linear systems over commutative rings
%J Journal of Computer and System Sciences
%K jcss
%V 14
%N 3
%D June 1977
%P 360-368

%A Toshimasa Watanabe
%A Shoichi Noguchi
%T The amalgamation of automata
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 1
%D August 1977
%P 1-16

%A T. Tsuji
%A J. Toyoda
%A K. Tanaka
%T Relational data graphs and some properties of them
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 1
%D August 1977
%P 17-34

%A S.A. Greibach
%T Control sets on context-free grammar forms
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 1
%D August 1977
%P 35-98

%A Anton Nijholt
%T On the covering of parsing grammars
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 1
%D August 1977
%P 99-110

%A Adrian Atanasiu
%T C-grammars and tree-codifications
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 1
%D August 1977
%P 111-120

%A Tadakazu Sato
%A Namio Honda
%T Certain relations between properties of maps of tessalation automata
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 121-145

%A Bernd Reusch
%T Linear realization of finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 146-168

%A Rina S. Cohen
%A Arie Y. Gold
%T Theory of omega-languages I:
characterizations of omega-context-free languages
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 169-184

%A Rina S. Cohen
%A Arie Y. Gold
%T Theory of omega-languages II:
a study of various models of omega-type generation and recognition
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 185-208

%A Mitchell Wand
%T A characterization of weakest preconditions
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 209-212

%A Tommaso Toffoli
%T Computation and construction universality
of reversible cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 213-231

%A Gyorgy Revesz
%T Algebraic properties of derivation words
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 2
%D October 1977
%P 232-240

%A Stephen J. Willson
%T Limiting shapes for configurations
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 243-261

%A Armin Cremers
%A Seymour Ginsburg
%A Edwin H. Spanier
%T The structure of context-free grammatical families
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 262-279

%A Walter A. Burkhard
%T Associative retrieval trie hash-coding
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 280-299

%A Amelia C. Fong
%A Jeffrey D. Ullman
%T Finding the depth of a flow graph
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 300-309

%A Meera Blattner
%A Tom Head
%T Single-valued a-transducers
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 310-327

%A Joost Engelfriet
%A Erik Meiniche Schmidt
%T IO and OI I
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 328-353

%A Igal Golan
%T Conditional grammars
%J Journal of Computer and System Sciences
%K jcss
%V 15
%N 3
%D December 1977
%P 354-371

%A Theodore P. Baker
%T "Natural" properties of flowchart step-counting measures
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 1-22

%A M.B. Smith
%T Power domains
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 23-36

%A J.A. Brzozowski
%A R. Knast
%T The dot-depth hierarchy of star-free languages is infinite
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 37-55

%A Torleiv Klove
%T On complements of unary L languages
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 56-66

%A Joost Engelfriet
%A Erik Meineche Schmidt
%T IO and OI II
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 67-99

%A J. Berger
%A C. Pair
%T Inference for regular bilanguages
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 1
%D February 1978
%P 100-122

%A Richard J. Lipton
%A Larrty Stockmeyer
%T Evaluation of polynomials with super-preconditioning
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 124-139

%A Zvi Galil
%T Palindrome recognition in real time by a multitape Turing machine
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 140-157

%A M.S. Paterson
%A M.N. Wegman
%T Linear unification
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 158-167

%A Kenneth L. Manders
%A Leonard Adleman
%T NP-complete decision problems for binary quadratics
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 168-184

%A Thomas J. Schaefer
%T On the complexity of some two-person perfect-information games
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 185-265

%A Leo J. Guibas
%A Endre Szemeredi
%T The analysis of double hashing
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 2
%D April 1978
%P 266-274

%A Rina S. Cohen
%A Arie Y. Gold
%T omega-computations on deterministic pushdown machines
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 275-300

%A Arne T. Jonassen
%A Donald E. Knuth
%T A trivial algorithm whose analysis isn't
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 301-322

%A Derek C. Oppen
%T A 2^2^2pn upper bound on the complexity of Presburger arithmetic
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 323-332

%A Francis Chin
%A David Houck
%T Algorithms for updating minimal spanning trees
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 333-344

%A H.A. Maurer
%A A. Salomaa
%A D. Wod
%T ET0L forms
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 345-361

%A Calvin C. Elgot
%A Stephen L. Vloom
%A Ralph Tindell
%T On the algebraic structure of rooted trees
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 362-399

%A P.F. Schuler
%T Inductive definability in formal language theory
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 400-412

%A David Dobkin
%A Richard J. Lipton
%T A lower bound on 1/2n^2 on linear search programs
for the knapsack problem
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 413-417

%A J. Hartmanis
%A L. Berman
%T On polynomial time isomorphisms of some new complete sets
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 418-422

%A Paul M.B. Vitanyi
%A Walter J. Savitch
%T On inverse deterministic pushdown transductions
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 423-44

%A Andrew G. Barto
%T A note on pattern reproduction in tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 445-455

%A Detlef Wotschke
%T Nondeterminism and boolean operations in pda's
%J Journal of Computer and System Sciences
%K jcss
%V 16
%N 3
%D June 1978
%P 456-461

%A Yasuyoshi Inagaki
%A Toshiki Sakabe
%A Teruo Fukumura
%T Addressable approximations to nonaddressable data graphs
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 1-34

%A Anita K. Jones
%A Richard J. Lipton
%T The enforcement of security policies for computation
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 35-55

%A Seth Breidbart
%T On splitting recursive sets
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 56-64

%A Masami Ito
%T A representation of strongly connected automata and its applications
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 65-80

%A Yaacov Choueka
%T Finite automata, definable sets,
and regular expressions over omega^m-tapes
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 81-97

%A Carlton J. Maxson
%A Kirby C. Smith
%T Endomorphisms of linear automata
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 98-107

%A William F. McColl
%T The circuit depth of symmetric boolean functions
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 108-115

%A Stephen J. Hegner
%T Duality theory for discrete-time linear systems
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 1
%D August 1978
%P 116-144

%A Nicholas Pippenger
%T On rearrangeable and non-blocking switching networks
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 145-162

%A K. Culik,\ II
%A Arto Salomaa
%T On the decidability of homomorphism equivalence for languages
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 163-175

%A Ulrich Golze
%T (A-) synchronous (non-) deterministic cell spaces
simulating each other
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 176-193

%A Bernd Reusch
%T Realization of finite automata with linear parts
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 194-206

%A Sudhir Aggarwal
%T A note on "indecomposable parallel maps"
by S. Amoroso and I.J. Epstein
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 207-236

%A G. Plotkin
%T T^omega as a universal domain
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 237-252

%A Lutz Priese
%T A note on asynchronous cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 253-269

%A Dan Moore
%A John Case
%T The complexity of total order structures
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 253-269

%A Claudio L. Lucchesi
%A Sylvia L. Osborn
%T Candidate keys for relations
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 2
%D October 1978
%P 270-280

%A K.N. King
%A C. Wrathall
%T Stack languages and log n space
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 281-299

%A Kojiro Kobayashi
%T The firing squad synchronization problem
for a class of polyautomata networks
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 300-318

%A T.S.E. Maibaum
%T Pumping lemmas for term languages
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 319-330

%A A. Ehrenfeucht
%A G. Rozenberg
%T On the structure of derivations in deterministic ETOL systems
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 331-347

%A Robin Milner
%T A theory of type polymorphism in programming
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 348-375

%A Tadao Takaoka
%T A definition of measures over language space
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 376-387

%A Bruno Courcelle
%A Irene Guessarian
%T On some classes of interpretations
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 388-413

%A Moshe Rabinovitz
%T Closure properties and languages defined by bilinear automata
%J Journal of Computer and System Sciences
%K jcss
%V 17
%N 3
%D December 1978
%P 414-423

%A Jon T. Butler
%T Decomposable maps in general tessalation structures
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 1-7

%A A. Nozaki
%T Equivalence problem of non-deterministic finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 8-17

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T Some decision problems concerning
sequential transducers and checking automata
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 18-34

%A R. Valette
%T Analysis of Petri nets by stepwise refinements
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 35-46

%A Akira Maruoka
%A Masayuki Kimura
%T Injectivity and surjectivity of parallel maps for cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 47-64

%A Yves Rouchaleau
%A Eduardo D. Sontag
%T On the existence of minimal realizations
of linear dynamical systems over Noetherian integral domains
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 65-75

%A S.L. Mitchell
%A E.J. Cockayne
%A S.T. Hedetniemi
%T Linear algorithms on recursive representations of trees
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 76-85

%A David P. Dobkin
%A Richard J. Lipton
%T On the complexity of computations under varying sets of primitives
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 86-91

%A Matti Linna
%T Two decidability results for deterministic pushdown automata
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 1
%D February 1979
%P 92-108

%A Robert Endre Tarjan
%T A class of algorithms which require nonlinear time
to maintain disjoint sets
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 2
%D April 1979
%P 110-127

%A Gary L. Miller
%T Graph isomorphism, general remarks
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 2
%D April 1979
%P 128-142

%A J. Lawrence Carter
%A Mark N. Wegman
%T Universal classes of hash functions
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 2
%D April 1979
%P 143-154

%A D. Angluin
%A L.G. Valiant
%T Fast probabilistic algorithms for Hamiltonian circuits and matchings
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 2
%D April 1979
%P 155-193

%A Michael J. Fischer
%A Richard E. Ladner
%T Propositional dynamic logic of processes
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 2
%D April 1979
%P 194-212

%A Arthur G. Werschulz
%T Optimal order for approximation of derivatives
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 213-217

%A David A. Poplawski
%T On LL-regular grammars
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 218-227

%A Susanna Ginall
%T Regular trees and the free iterative theory
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 228-242

%A Hiroakira Ono
%A Akira Nakamura
%T Undecidability of the first-order arithmetic A[P(x), 2x, x+1]
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 243-253

%A Emility P. Friedman
%A Sheila A. Greibach
%T Monadic recursion schemes: the effect of constants
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 254-266

%A Gheorghe Paun
%T On the family of finite index matrix languages
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 267-280

%A Elaine J. Weyuker
%T Modifications of the program scheme model
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 281-293

%A Dan Gordon
%T Complexity classes of provable recursive functions
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 294-303

%A Paolo A.S. Veloso
%A Arthur Gill
%T Some remarks on multiple-entry finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 304-306

%A Michel Latteux
%T Cones rationnels commutatifs
%J Journal of Computer and System Sciences
%K jcss
%V 18
%N 3
%D June 1979
%P 307-333

%A C. Pair
%A M. Amirchany
%A D. Neel
%T Correctness proofs of syntax-directed
processing descriptions by attributes
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 1-17

%A Carlton J. Maxson
%A Kirby C. Smith
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 18-26

%A Mitchell Wand
%T Final algebra semantics and data type extensions
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 27-44

%A Meera Blattner
%A Tom Head
%T The decidability of equivalence for deterministic finite transducers
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 45-49

%A David B. Benson
%T Parameter passing in nondeterministic recursive programs
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 50-62

%A Michael A. Harrison
%A Amiram Yehudai
%T A hierarchy of deterministic languages
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 63-78

%A E.P. Friedman
%A S.A. Greibach
%T Superdeterministic DPDAs:
the method of accepting does affect decision problems
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 1
%D August 1979
%P 79-118

%A Tero Harju
%T A simulation result for the auxiliary pushdown automata
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 119-132

%A Giorgio Germano
%A Andrea Maggiolo-Schettini
%T Computable stack functions for semantics of stack programs
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 133-144

%A Eiten M. Gurrari
%A Oscar H. Ibarra
%T Simple counter machines and number-theoretic problems
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 145-162

%A Jiri Adamek
%A Vaclav Koubek
%T Least fixed point of a functor
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 163-178

%A G. Rozenberg
%A D. Vermeir
%T On recursion in ETOL systems
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 179-196

%A W.J. Paul
%T On time hierarchies
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 197-202

%A Tom Head
%T Codeterministic Lindenmayer schemes and systems
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 2
%D October 1979
%P 203-210

%A Sharad V. Kanetkar
%A Meghanad D. Wagh
%T Group character tables in discrete transform theory
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 211-221

%A H.B. Hunt,\ III
%T Observations on the complexity of regular expression problems
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 222-236

%A A. Ehrenfeucht
%A G. Rozenberg
%A D. Vermeir
%T On ETOL systems with rank
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 237-255

%A Ronald V. Book
%A Sheila A. Greibach
%A Celia Wrathall
%T Reset machines
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 256-276

%A G. Naude
%T Universal realization
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 277-289

%A Nissim Francez
%A C.A.R. Hoare
%A Daniel J. Lehmann
%A Williem P. de\ Roever
%T Semantics of nondeterminism, concurrency, and communication
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 290-308

%A A. Nozaki
%T Sorting using networks of deques
%J Journal of Computer and System Sciences
%K jcss
%V 19
%N 3
%D December 1979
%P 309-315

%A Takumi Kasai
%A Akeo Adachi
%T A characterization of time complexity by simple loop programs
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 1-17

%A William J. Masek
%A Michael S. Paterson
%T A faster algorithm computing string edit distances
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 18-31

%A J.A. Brzozowski
%A Faith E. Fich
%T Languages of R-trivial monoids
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 32-49

%A John Gallant
%A David Maier
%A James A. Storer
%T On finding length superstrings
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 50-58

%A Saturo Miyano
%T One-way weak-stack-counter automata
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 59-76

%A Teofilo Gonzalez
%A Joseph Ja'Ja'
%T On the complexity of computing bilinear forms with {0,1} constants
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 77-95

%A Matthew C.B. Hennessy
%T A proof system for the first-order relational calculus
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 96-110

%A Paul Dietz
%A S. Rao Kosaraju
%T Recognition of topological equivalence of patterns by array automata
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 1
%D February 1980
%P 111-116

%A Martin Tompa
%T Time-space tradeoffs for computing functions,
using connectivity properties of their circuits
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 118-132

%A Andrea S. LaPaugh
%A Ronald L. Rivest
%T The subgraph homeomorphism problem
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 133-149

%A Joost Engelfriet
%A Grzegorz Rozenberg
%A Giora Slutzki
%T Tree transducers, L systems, and two-way machines
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 150-202

%A Raymond E. Miller
%A Chee K. Yap
%T On formulating simultaneity
for studying parallelism and synchronization
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 203-218

%A John M. Lewis
%A Mihalis Yannakakis
%T The node-deletion problem for hereditary properties is NP-complete
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 219-230

%A Vaughan R. Pratt
%T A near-optimal method for reasoning about action
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 231-254

%A I.S. Filotti
%T An algorithm for imbedding cubic graphs in the torus
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 2
%D April 1980
%P 255-276

%A A. Ginzburg
%A M. Yoeli
%T Vector addition systems and regular languages
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 277-284

%A Luc Boasson
%A Maurice Nivat
%T Adherences of languages
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 285-309

%A Jan Paredaens
%T The interaction of integrity constraints in an information system
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 310-329

%A Michael A. Arbib
%A Ernest G. Manes
%T Foundations of system theory: the Hankel matrix
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 330-378

%A Karel Culik,\ II
%A Arto Salomaa
%T Test sets and checking words for homomorphism equivalence
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 379-395

%A R.L. Rivest
%A A.R. Meyer
%A D.J. Kleitman
%A K. Winklmann
%A J. Spencer
%T Coping with errors in binary search procedures
%J Journal of Computer and System Sciences
%K jcss
%V 20
%N 3
%D June 1980
%P 396-404

%A Dabiel J. Lehmann
%T On the algebra of order
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 1-23

%A Lazaros P. Mavrides
%T A finite step-size procedure for the F-W method
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 24-29

%A Shigeku Seki
%A Youichi Kobuchi
%T On DIL schemes simulated by D0L schemes
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 30-45

%A Dana Angluin
%T Finding patterns common to a set of strings
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 46-62

%A Satoru Fujishige
%T An efficient PQ-graph algorithm
for solving the graph-realization problem
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 63-86

%A Tom Head
%T A-transducers and the monotonicity of IL schemes
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 87-91

%A Jeffrey M. Jaffe
%T The equivalence of R.E. program schemes and data flow schemes
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 92-109

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T Context-free grammar forms with strict interpretations
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 110-135

%A G. Ausiello
%A A. D'Atri
%A M. Protasi
%T Structure preserving reductions among convex optimization problems
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 1
%D August 1980
%P 136-154

%A Ashok K. Chandra
%A David Harel
%T Computable queries for relational data bases
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 156-178

%A Richard E. Ladner
%T The complexity of problems
in systems of communicating sequential processes
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 179-194

%A Michael Sipser
%T Lower bounds on the size of sweeping automata
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 195-202

%A Zvi Galil
%A Amnon Naamad
%T An O(EV log^2 V) algorithm for the maximal flow problem
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 203-217

%A Walter L. Ruzzo
%T Tree-size bounded alternation
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 218-235

%A J. Ian Munro
%A Hendra Suwanda
%T Implicit data structures for fast search and update
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 2
%D October 1980
%P 236-250

%A Nancy A. Lynch
%T Straight-line program length as a parameter for complexity analysis
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 251-280

%A G. Naude
%T A duality theory for decomposable systems in a category
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 281-291

%A Franz-Josef Brandenburg
%T Multiple equality sets and Post machines
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 292-316

%A Harry R. Lewis
%T Complexity results for classes of quantificational formulas
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 317-353

%A Gaston H. Gonnet
%T Open-addressing hashing with unequal-probability keys
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 354-367

%A David Maier
%A Alberto O. Mendelzon
%A Fereidoon Sadre
%A Jeffrey D. Ullman
%T Adequacy of decomposition of relational databases
%J Journal of Computer and System Sciences
%K jcss
%V 21
%N 3
%D December 1980
%P 368-379

%A Shlomo Moran
%T Some results on relativized
deterministic and nondeterministic time hierarchies
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 1-8

%A Tsuyoshi Nakamura
%T Regularity and firing sequences of computation graphs
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 9-28

%A Stephen J. Willson
%T Growth patterns of ordered cellular automata
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 29-41

%A Keijo Ruohonen
%T The decidability of the DOL-DTOL equivalence problem
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 42-52

%A Paul Chew
%A Michael Machtey
%T A note on structure and looking back
applied to the complexity of computable functions
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 53-59

%A Tatsuo Ohtsuki
%A Hajimu Mori
%A Toshinobu Kashiwabara
%A Toshio Fujisawa
%T On minimal augmentation of a graph to obtain an interval graph
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 60-97

%A Robert Melville
%T An improved simulation results for ink-bounded Turing machines
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 1
%D February 1981
%P 98-106

%A Gregory A. Riccardi
%T The independence of control structures
in abstract programming systems
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 107-143

%A D. Janssens
%A G. Rozenberg
%T Decision problems for node label controlled graph grammars
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 144-177

%A David A. Workman
%T SR(s, k) parsers: a class of shift-reduce bounded-context parsers
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 178-197

%A M.P. Georgeff
%T Interdependent translation schemes
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 198-219

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T The complexity of decision problems
for finite-turn multicounter machines
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 220-229

%A John E. Savage
%T Area-time tradeoffs for matrix multiplication
and related problems in VLSI models
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 230-242

%A Theodore P. Baker
%T Extending lookahead for LR parsers
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 2
%D April 1981
%P 243-260

%A Mark N. Wegman
%A J. Lawrence Carter
%T New hash functions and their use in authentication and set equality
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 265-279

%A Gilles Brassard
%T A time-luck tradeoff in relativized cryprography
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 280-311

%A W. Paul
%A R. Reischuk
%T On time versus space II
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 312-327

%A Dexter Kozen
%T Semantics of probabilistic programs
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 328-350

%A Allan Borodin
%A Michael J. Fischer
%A David G. Kirkpatrick
%A Nancy A. Lynch
%A Martin Tompa
%T A time-space tradeoff for sorting on non-oblivious machines
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 351-364

%A Walter L. Ruzzo
%T On uniform circuit complexity
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 365-383

%A Neil Immerman
%T Number of quantifiers is better than number of tape cells
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 384-406

%A Ofer Gabber
%A Zvi Galil
%T Explicit constructions of linear-sized superconcentrators
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 407-420

%A Janos Simon
%T Division in idealized unit cost RAMs
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 421-441

%A Michael Machtey
%A Paul Young
%T Remarks on recursion versus diagonalization
and exponentially difficult problems
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 442-453

%A Nicholas Pippenger
%T Computation complexity of algebraic functions
%J Journal of Computer and System Sciences
%K jcss
%V 22
%N 3
%D June 1981
%P 454-470

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T Completeness of context-free grammar forms
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 1-10

%A Gerard Huet
%T A complete proof of correctness
of the Knuth-Bendix completion algorithm
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 11-21

%A Katsuhiko Nakamura
%T Synchronous to asynchronous transformation of polyautomata
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 22-37

%A Arthur G. Werschultz
%T On maximal order for local and global numerical problems
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 38-48

%A R.J.R. Back
%T On correct refinement of programs
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 49-68

%A Jean H. Gallier
%T Recursion closed algebraic theories
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 1
%D August 1981
%P 69-105

%A Wolfgang J. Paul
%A Joel I. Seiferas
%A Janos Simon
%T An information-theoretic approach
to time bounds for on-line computation
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 108-126

%A Martin Tompa
%T An optimal solution to a wire-routing problem
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 127-150

%A Nicholas Pippenger
%T Pebbling with an auxiliary pushdown
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 151-165

%A Mark H. Overmars
%A Jan van\ Leeuwen
%T Maintenance of configurations in the plane
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 166-204

%A Deborah Joseph
%A Paul Young
%T Independence results in computer science ?
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 205-222

%A Hartmut Ehrig
%A Bernd Mahr
%T Complexity of algebraic implementations for abstract data types
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 223-253

%A Nancy A. Lynch
%T Upper bounds for static resource allocation in a distributed system
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 254-278

%A Albert R. Meyer
%A Rohit Parikh
%T Definability in dynamic logic
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 2
%D October 1981
%P 279-298

%A Rudiger Valk
%A Guy Vidal-Naquet
%T Petri nets and regular languages
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 299-325

%A Alan L. Selman
%T Some observations on NP real numbers and P-selective sets
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 326-332

%A Lawrence Snyder
%T Theft and conspiracy in the take-grant protection model
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 333-347

%A Ernst Leiss
%T The complexity of restricted regular expressions
and the synthesis problem for finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 348-354

%A Michael L. Fredman
%A Dennis J. Volper
%T Query time versus redundancy trade-offs for range queries
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 355-365

%A Michio Oyamaguchi
%A Yasuyoshi Inagaki
%A Namio Honda
%T The equivalence problem for two-dpda's,
one of which is a finite turn or one-counter machine
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 366-382

%A Luigia Aiello
%A Gianfranco Prini
%T An efficient interpreter for the lambda-calculus
%J Journal of Computer and System Sciences
%K jcss
%V 23
%N 3
%D December 1981
%P 383-424

%A Sharon J. Laskowski
%T Computing lower bounds on tensor rank over finite fields
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 1-14

%A Ker-I Ko
%T The maximum value problem and NP real numbers
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 15-35

%A Jan Pittl
%T On LLP(k) parsers
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 36-68

%A Oscar H. Ibarra
%A Shlomo Moran
%T On some decision problems for RAM programs
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 69-81

%A Nicholas Pippenger
%T Superconcentrators of depth 2
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 82-90

%A Amiram Yehudai
%T A hierarchy of real-time deterministic languages
and their equivalence
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 91-100

%A Nancy A. Lynch
%T Accessibility of values as a determinant
of relative complexity in algebras
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 101-113

%A Jiri Adamek
%A Evelyn Nelson
%A Jan Reiterman
%T Tree constructions of free continuous algebras
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 1
%D February 1982
%P 114-146

%A Anton Nijholt
%T The equivalence problem for LL- and LR-regular grammars
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 149-161

%A Michael Rodeh
%T Finding the median distributively
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 162-166

%A J. Albert
%A K. Culik,\ II
%T Tree correspondence problems
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 167-179

%A Jerry Goldman
%A Steven Homer
%T Quadratic automata
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 180-196

%A Greg N. Frederickson
%A Donald B. Johnson
%T The complexity of selection and ranking in X+Y
and matrices with sorted columns
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 197-208

%A Joseph Ja'Ja'
%T The computational complexity of a set of quadratic functions
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 209-223

%A Timothy J. Long
%T A note on sparse oracles for NP
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 224-232

%A K. Hashiguchi
%T Limitedness theorem on finite automata with distance functions
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 2
%D April 1982
%P 233-244

%A Andrea Maggiolo-Schettini
%A Jozef Winkowski
%T Processes of transforming structures
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 3
%D June 1982
%P 245-282

%A Joost Engelfriet
%A Gilberto File
%T Simple multi-visit attribute grammars
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 3
%D June 1982
%P 283-314

%A Seymour Ginsburg
%A Jonathan Goldstine
%A Edwin H. Spanier
%T A prime decomposition theorem for grammatical families
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 3
%D June 1982
%P 315-361

%A Hajime Machida
%A Takumi Kasai
%T Space complexity in on-line computation
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 3
%D June 1982
%P 362-372

%A M.B. Thuraisingham
%T Representation of one-one degrees
by decision problems for system functions
%J Journal of Computer and System Sciences
%K jcss
%V 24
%N 3
%D June 1982
%P 373-377

%A Mihalis Yannakakis
%A Christos H. Papadimitriou
%T Algebraic dependencies
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 1
%D August 1982
%P 2-41

%A Eugene M. Luks
%T Isomorphism of graphs of bounded valance
can be tested in polynomial time
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 1
%D August 1982
%P 42-65

%A Michael O. Rabin
%T N-process mutual exclusion with bounded waiting
by 4 log2 N-valued shared variable
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 1
%D August 1982
%P 66-75

%A Neil Immerman
%T Upper and lower bounds for first order expressibility
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 1
%D August 1982
%P 76-98

%A Ashok Chandra
%A David Harel
%T Structure and complexity of relational queries
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 1
%D August 1982
%P 99-128

%A Stephen R. Mahaney
%T Sparse complete sets for NP:
solution of a conjecture of Berman and Hartmanis
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 2
%D October 1982
%P 130-143

%A David Harel
%A Dexter Kozen
%A Rohit Parikh
%T Process logic: expressiveness, decidability, completeness
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 2
%D October 1982
%P 144-170

%A Philippe Flajolet
%A Andrew Odlyzko
%T The average height of binary trees and other simple trees
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 2
%D October 1982
%P 171-213

%A Lon Louis Bentley
%A Donna J. Brown
%T A general class of resource tradeoffs
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 2
%D October 1982
%P 214-238

%A Gerard Huet
%A Jean-Marie Hullot
%T Proofs by induction in equational theories with constructors
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 2
%D October 1982
%P 239-266

%A J.A. Bergstra
%A J.V. Tucker
%T Expressiveness and the completeness of Hoare's logic
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 267-284

%A Takumi Kasai
%A Raymond E. Miller
%T Homomorphisms between models of parallel computation
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 285-331

%A Christoph M. Hoffmann
%T Subcomplete generalizations of graph isomorphism
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 332-359

%A Wolfgang Thomas
%T Classifying regular events in symbolic logic
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 360-376

%A W. Kuich
%T An algebraic characterization
of some principal regulated rational cones
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 377-401

%A Mordechai Ben-Ari
%A Joseph Y. Halpern
%A Amir Pnueli
%T Deterministic propositional dynamic logic:
finite models, complexity, and completeness
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 402-417

%A Joost Engelfriet
%A Sven Skyum
%T The copying power of one-state tree transducers
%J Journal of Computer and System Sciences
%K jcss
%V 25
%N 3
%D December 1982
%P 418-435

%A Douglas Comer
%T Effects of updates on optimality in tries
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 1-13

%A Michel Latteux
%T Langages a un compteur
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 14-33

%A A. Ehrenfeucht
%A J. Engelfriet
%A G. Rozenberg
%T Context free normal systems and ETOL systems
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 34-46

%A Oscar H. Ibarra
%A Brian S. Leininger
%T On the zero-inequivalence problem for loop programs
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 47-64

%A David A. Carlson
%A John E. Savage
%T Size-space tradeoffs for oblivious computations
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 65-81

%A Jurgen Albert
%A Derick Wood
%T Checking sets, test sets,
rich languages and commutatively closed languages
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 82-91

%A Dave Riffelmacher
%T Multiplicative complexity and algebraic structure
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 92-106

%A Toshimasa Watanabe
%A Akira Nakamura
%T On the transformation semigroups of finite automata
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 107-138

%A John J. Grefenstette
%T Network structure and the firing squad synchronization problem
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 1
%D February 1983
%P 139-152

%A Esko Ukkonen
%T Lower bounds on the size of deterministic parsers
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 153-170

%A Seymour Ginsburg
%A Jonathan Goldstine
%A Edwin H. Spanier
%T On the equality of grammatical families
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 171-196

%A Takao Asano
%A Tomio Hirata
%T Edge-contraction problems
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 197-208

%A Kei-I Ko
%T On self-reducibility and weak P-selectivity
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 209-221

%A David Harel
%A Amir Pnueli
%A Jonathan Stavi
%T Propositional dynamic logic of nonregular programs
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 222-243

%A Seppo Sippu
%A Eljas Soisalon-Soinnen
%T On the complexity of LL(k) testing
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 244-268

%A Maurice Tchuente
%T Computation of boolean functions on networks of binary automata
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 2
%D April 1983
%P 269-278

%A Zvi Galil
%A Joel Seiferas
%T Time-space-optimal string matching
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 280-294

%A David E. Muller
%A Paul E. Schupp
%T Groups, the theory of ends, and context-free languages
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 295-310

%A Deborah Joseph
%T Polynomial time computations in models of ET
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 311-338

%A Daniel Kleitman
%A Frank Thompson Leighton
%A Margaret Lepley
%A Gary L. Miller
%T An asymptotically optimal layout for the shuffle-exchange graph
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 339-361

%A Daniel D. Sleator
%A Robert Endsre Tarjan
%T A data structure for dynamic trees
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 362-391

%A Faith E. Fich
%T Lower bounds for the cycle detection problem
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 392-409

%A K.N. Venkataraman
%A Ann Yasuhara
%A Frank M. Hawrusik
%T A view of computability on term algebras
%J Journal of Computer and System Sciences
%K jcss
%V 26
%N 3
%D June 1983
%P 410-471

%A Stephan Heilbrunner
%T Tests for the LR-, LL-, and LC-regular conditions
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 1-13

%A Use Schoning
%T A low and a high hierarchy within NP
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 14-28

%A Martha Steenstrup
%A Michael A. Arbib
%A Ernest G. Manes
%T Port automata and the algebra of concurrent processes
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 29-50

%A Ichiro Suzuki
%A Tadao Murata
%T A method of stepwise refinement and abstraction of Petri nets
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 51-76

%A James A. Storer
%T On the complexity of chess
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 77-100

%A Satoru Miyano
%T Remarks on multihead pushdown automata and multihead stack automata
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 101-115

%A Masanabu Ito
%A Nobuyasu Osato
%A Masakazu Nasu
%T Linear cellular automata over Zm
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 1
%D August 1983
%P 125-140

%A Stephen L. Bloom
%A James W. Thatcher
%A Eric G. Wagner
%A Jesse B. Wright
%T Recursion and iteration in continuous theories: the "M-construction"
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 147-163

%A Hartmut Schmeck
%T Algebraic characterization of reducible flowcharts
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 164-198

%A Francesco Parisi-Presicce
%T Extensions of iterative congruences on free iterative algebras
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 199-219

%A Douglas R. Troeger
%T An axiomatization of D-scheme strong equivalence
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 220-223

%A Stephen L. Bloom
%T All solutions of a system of recursion equations
in infinite trees and other contraction theories
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 224-253

%A Michael O. Rabin
%T Transaction protection by beacons
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 254-265

%A J.A. Goguen
%A J. Meseguer
%T Correctness of recursive parallel nondeterministic flow programs
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 266-288

%A Z. Esik
%T Algebras of iteration theories
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 289-301

%A Edward K. Blum
%A Francesco Parisi-Presicce
%T Implementation of data types by algebraic methods
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 2
%D October 1983
%P 302-330

%A Richard Hull
%T Acyclic join dependency and data base projections
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 331-349

%A Nancy A. Lynch
%A Michael J. Fischer
%T A technique for decomposing algorithms
which use a single shared variable
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 350-377

%A Bernard R. Hodgson
%A Clement F. Kent
%T A normal form for arithmetical representation of NP-sets
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 378-388

%A Egidio Astesiano
%A Gerardo Costa
%T The insensitivity theorem for nonreducing reflexive types
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 389-399

%A Richard J. Lorentz
%A David B. Benson
%T Deterministic and nondeterministic flowchart interpretations
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 400-433

%A Ludwig Staiger
%T Finite-state omega-languages
%J Journal of Computer and System Sciences
%K jcss
%V 27
%N 3
%D December 1983
%P 434-448

%A Moshe Y. Vardi
%T The implication and finite implication problem
for typed template dependencies
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 3-28

%A Marco A. Casanova
%A Ronald Fagin
%A Christos H. Papadimitriou
%T Inclusion dependencies
and their interaction with functional dependencies
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 29-59

%A Nathan Goodman
%A Oded Shmueli
%T The tree projection theorem and relational query processing
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 60-79

%A Tomasz Imielinski
%A Witold Lipski,\ Jr.
%T The relational model of data and cylindric algebras
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 80-102

%A Paris C. Kanellakis
%A Christos H. Papadimitriou
%T Is distributed locking harder ?
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 103-120

%A Marc H. Graham
%A Mihalis Yannakakis
%T Independent database schemas
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 121-141

%A Carlo Zaniolo
%T Database relations with null values
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 142-166

%A D.S. Johnson
%A A. Klug
%T Testing containment of conjunctive queries
under functional and inclusion dependencies
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 1
%D February 1984
%P 167-190

%A Yishai A. Feldman
%A David Harel
%T A probabilistic dynamic logic
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 193-215

%A Walter L. Ruzzo
%A Janos Simon
%A Martin Tompa
%T Space-bounded hierarchies and probabilistic computations
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 216-230

%A Martin Furer
%T Data structures for distributed counting
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 231-243

%A C.H. Papadimitriou
%A M. Yannakakis
%T The complexity of facets (and some facets of complexity)
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 244-259

%A Christos H. Papadimitriou
%A Michael Sipser
%T Communication complexity
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 260-269

%A Shafi Goldwasser
%A Silvio Micali
%T Probabilistic encryption
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 270-299

%A Sandeep N. Bhatt
%A Frank Thomson Leighton
%T A framework for solving VLSI graph layout problems
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 2
%D April 1984
%P 300-344

%A Manfred K. Warmuth
%A David Haussler
%T On the complexity of iterated shuffle
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 345-358

%A Michael C. Loui
%T Minimizing access pointers into trees and arrays
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 359-378

%A Dan E. Willard
%T New trie data structures which support very fast search operations
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 379-394

%A H.B. Hunt,\ III
%A D.J. Rosenkrantz
%T The complexity of monadic recursion schemes: exponential time bounds
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 395-419

%A Errol L. Lloyd
%A S.S. Ravi
%T One-layer routing without component constraints
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 420-438

%A Robin Milner
%T A complete inference system for a class of regular behaviours
%J Journal of Computer and System Sciences
%K jcss
%V 28
%N 3
%D June 1984
%P 439-466

%A Luc Devroye
%T Exponential bounds for the running time of a selection algorithm
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 1-7

%A David A. Plaisted
%T Complete problems in the first-order predicate calculus
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 8-35

%A Kokichi Sugihara
%T An n log n algorithm for determining the congruity of polyhedra
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 36-47

%A Jan K. Pachl
%T Finding pseudoperipheral nodes in graphs
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 48-53

%A M. Latteux
%A G. Rozenberg
%T Commutative one-counter languages are regular
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 54-57

%A Tsong Yueh Chen
%T On the fixpoints of nondeterministic recursive definitions
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 58-79

%A F. Kroger
%T A generalized nexttime operator in temporal logic
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 80-98

%A Douglas R. Troeger
%T Weak equivalence in a class of structured program schemes
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 99-117

%A Walter J. Savitch
%A Patrick W. Dymond
%T Consistency in nondeterministic storage
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 1
%D August 1984
%P 118-132

%A W.J. Hsu
%A M.W. Du
%T New algorithms for the LCS problem
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 133-152

%A Antonio Restivo
%A Christphe Reutenauer
%T On cancellation properties of languages
which are supports of rational power series
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 153-159

%A Albert R. Meyer
%A Jerzy Tiuryn
%T Equivalences among logics of programs
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 160-170

%A Hiromi Miyajima
%A Masateru Harao
%A Shoichi Noguchi
%T Indecomposable maps in tessalation structures of arbitrary dimension
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 171-182

%A Yaacov Yesha
%T Time-space tradeoffs for matrix multiplication
and the discrete Fourier transform
of any general sequential random-access computer
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 183-197

%A Sara Porat
%A Michael Yoeli
%T Towards a hierarchy of nets
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 198-206

%A Shojiro Muro
%A Tiko Kameda
%A Toshimi Minoura
%T Multi-version concurrency control scheme for a database system
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 207-224

%A Simeon Ntafos
%A Teofilo Gonzalez
%T On the computational complexity of path cover problems
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 225-242

%A John E. Savage
%T The performance of multilective VLSI algorithms
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 243-273

%A John H. Reif
%T The complexity of two-layer games of incomplete information
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 2
%D October 1984
%P 274-302

%A Paul M.B. Vitanyi
%T On two-tape real-time computation and queues
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 303-311

%A Tatsuya Motoki
%T An application of Cohen's result on star height
to the theory of control structures
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 312-329

%A Mikhail Atallah
%A Uzi Vishkin
%T Finding Euler tours in parallel
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 330-337

%A Nathan Goodman
%A Oded Shmueli
%A Y.C. Tay
%T GYO reductions, canonical connections,
tree and cyclic schemas, and tree projections
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 338-358

%A D. Harel
%A M.S. Paterson
%T Undecidability of PDL with L = {a^2^i | i >= 0}
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 359-365

%A Joost Engelfriet
%A Giora Slutzki
%T Extended macro grammars and stack controlled machines
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 366-408

%A Clement T. Yu
%A Z. Meral Ozsoyoglu
%A K. Lam
%T Optimization of distributed tree queries
%J Journal of Computer and System Sciences
%K jcss
%V 29
%N 3
%D December 1984
%P 409-445