


default search action
JCSS, Volume 27
Volume 27, Number 1, August 1983
- Stephan Heilbrunner:

Tests for the LR-, LL-, and LC-Regular Conditions. 1-13 - Uwe Schöning:

A Low and a High Hierarchy within NP. 14-28 - Martha Steenstrup, Michael A. Arbib, Ernest G. Manes:

Port Automata and the Algebra of Concurrent Processes. 29-50 - Ichiro Suzuki, Tadao Murata:

A Method for Stepwise Refinement and Abstraction of Petri Nets. 51-76 - James A. Storer:

On the Complexity of Chess. 77-100 - Kosaburo Hashiguchi:

Representation Theorems on Regular Languages. 101-115 - Satoru Miyano:

Remarks on Multihead Pushdown Automata and Multihead Stack Automata. 116-124 - Masanobu Ito, Nobuyasu Osato, Masakazu Nasu:

Linear Cellular Automata over Z_m. 125-140
Volume 27, Number 2, October 1983
- Stephen L. Bloom, James W. Thatcher, Eric G. Wagner, Jesse B. Wright:

Recursion and Iteration in Continuous Theories: The "M-Construction". 148-164 - Hartmut Schmeck

:
Algebraic Characterization of Reducible Flowcharts. 165-199 - Francesco Parisi-Presicce:

Extensions of Iterative Congruences on Free Iterative Algebras. 200-220 - Douglas R. Troeger:

An Axiomatization of D-scheme Strong Equivalence. 221-224 - Stephen L. Bloom:

All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories. 225-255 - Michael O. Rabin:

Transaction Protection by Beacons. 256-267 - Joseph A. Goguen, José Meseguer:

Correctness of Recursive Parallel Nondeterministic Flow Programs. 268-290 - Zoltán Ésik:

Algebras of Iteration Theories. 291-303 - Edward K. Blum, Francesco Parisi-Presicce:

Implementation of Data Types by Algebraic Methods. 304-330
Volume 27, Number 3, December 1983
- Richard Hull:

Acyclic Join Dependency and Data Base Projections. 331-349 - Nancy A. Lynch, Michael J. Fischer:

A Technique for Decomposing Algorithms Which Use a Single Shared Variable. 350-377 - Bernard R. Hodgson, Clement F. Kent:

A Normal Form for Arithmetical Representation of NP-Sets. 378-388 - Egidio Astesiano, Gerardo Costa:

The Insensitivity Theorem for Nonreducing Reflexive Types. 389-399 - Richard J. Lorentz, David B. Benson:

Deterministic and Nondeterministic Flowchart Interpretations. 400-433 - Ludwig Staiger

:
Finite-State omega-Languages. 434-448

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














