default search action
JCSS, Volume 15
Volume 15, Number 1, August 1977
- Toshimasa Watanabe, Shoichi Noguchi:
The Amalgamation of Automata. 1-16 - T. Tsuji, Jun'ichi Toyoda, Kokichi Tanaka:
Relational Data Graphs and Some Properties of Them. 17-34 - Sheila A. Greibach:
Control Sets of Context-Free Grammar Forms. 35-98 - Anton Nijholt:
On the Covering of Parsable Grammars. 99-110 - Adrian Atanasiu:
C-Grammars and Tree-Codifications. 111-120
Volume 15, Number 2, October 1977
- Tadakazu Sato, Namio Honda:
Certain Relations between Properties of Maps of Tessellation Automata. 121-145 - Bernd Reusch:
Linear Realization of Finite Automata. 146-168 - Rina S. Cohen, Arie Y. Gold:
Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages. 169-184 - Rina S. Cohen, Arie Y. Gold:
Theory of omega-Languages. II. A Study of Various Models of omega-Type Generation and Recognition. 185-208 - Mitchell Wand:
A Characterization of Weakest Preconditions. 209-212 - Tommaso Toffoli:
Computation and Construction Universality of Reversible Cellular Automata. 213-231 - György E. Révész:
Algebraic Properties of Derivation Words. 232-240 - Neil D. Jones:
Corrigendum: Space-Bounded Reducibility among Combinatorial Problems. 241
Volume 15, Number 3, December 1977
- Stephen J. Willson:
Limiting Shapes for Configurations. 243-261 - Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier:
The Structure of Context-Free Grammatical Families. 262-279 - Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding. 280-299 - Amelia C. Fong, Jeffrey D. Ullman:
Finding the Depth of a Flow Graph. 300-309 - Meera Blattner:
Single-Valued a-Transducers. 310-327 - Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. I. 328-353 - Igal Golan:
Conditional Grammars. 354-371
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.