default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 12
Volume 12, Number 1, February 1976
- Takeo Yaku:
Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata. 1-5 - Daniel Richardson:
Continuous Self-Reproduction. 6-12 - F. Joanne Helton:
The Semigroup of an Algebra Automaton. 13-24 - Sam L. Savage, Peter Weiner, A. Bagchi:
Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient. 25-35 - Masakazu Nasu, Namio Honda:
A Completeness Property of One-Dimensional Tessellation Automata. 36-48 - Yoshinori Ezawa, Masaharu Mizumoto, Jun'ichi Toyoda, Kokichi Tanaka:
Interactive Languages. 49-63 - Johnson M. Hart:
The Derivation Language of a Phrase Structure Grammar. 64-79 - Klaus Weihrauch:
The Computational Complexity of Program Schemata. 80-107 - Robert R. Meyer:
Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms. 108-121 - Forbes D. Lewis:
On Computational Reducibility. 122-131
Volume 12, Number 2, April 1976
- Andrzej Ehrenfeucht, H. Paul Zeiger:
Complexity Measures for Regular Expressions. 134-146 - Kurt Mehlhorn:
Polynomial and Abstract Subrecursive Classes. 147-178 - Bruno Courcelle, Jean Vuillemin:
Completeness Results for the Equivalence of Recursive Schemas. 179-197 - Vaughan R. Pratt, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. 198-221 - Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski:
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. 222-268
Volume 12, Number 3, June 1976
- Hartmut Ehrig, Hans-Jörg Kreowski:
Systematic Approach to Reduction and Minimization in Automata and System Theory. 269-304 - Stephen L. Bloom, Calvin C. Elgot:
The Existence and Construction of Free Iterative Theories. 305-318 - John L. Bruno, Edward G. Coffman Jr., D. B. Johnson:
On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server. 319-335 - Yuri Breitbart:
Some Bounds on the Complexity of Predicate Recognition by Finite Automata. 336-349 - Zvi Galil, Janos Simon:
A Note on Multiple-Entry Finite Automata. 350-351 - Kosaburo Hashiguchi, Namio Honda:
Properties of Code Events and Homomorphisms over Regular Events. 352-367 - Donald A. Alton:
Nonexistence of Program Optimizers in Several Abstract Settings. 368-393 - Peter Gordon Anderson:
Another Proof of the Theorem on Pattern Reproduction in Tessellation Structures. 394-398 - Jonathan Goldstine:
Bounded AFLs. 399-419
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-24 17:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
