default search action
Mathematical Systems Theory, Volume 5
Volume 5, Number 1, 1971
- Bernard P. Zeigler:
A Note on Series Parallel Irreducibility. 1-3 - Nobuo Aoki:
Topological Entropy and Measure-Theoretic Entropy for Automorphisms on Compact Groups. 4-7 - Gerard Lallement:
On the Prime Decomposition Theorem for Finite Monoids. 8-12 - James Carlyle Lillo:
The Green's Function for nth-Order Periodic Differential-Difference Equations. 13-19 - William A. Porter:
A Basic Optimization Problem in Linear Systems. 20-44 - Herbert S. Shank:
Graph Property Recognition Machines. 45-49 - Herbert S. Shank:
Records of Turing Machines. 50-55 - S. P. Gordon:
Stability and Summability of Solutions of Difference Equations. 56-65 - Paul Young:
A Note on Dense and Nondense Families of Complexity Classes. 66-70 - Benjamin Weiss:
Topological Transitivity and Ergodic Measures. 71-75 - Leonard D. Shapiro:
Distal and Proximal Extensions of Minimal Flows. 76-88 - Eugene M. Norris:
Inverse Limits and Embedding of Compact Totally Disconnected Machines. 89-94 - Donald E. Knuth:
Correction: Semantics of Context-Free Languages. 95-96
Volume 5, Number 2, 1971
- Rina S. Cohen:
Techniques for Establishing Star Height of Regular Sets. 97-114 - Gabor T. Herman:
When is a Sequential Machine the Realization of Another? 115-127 - Dirk van Dalen:
A Note on Some Systems of Lindenmayer. 128-140 - David Stadtlander:
A Structure Theorem for \delta-Classes of Compact Semigroup Actions. 141-144 - John S. Lew:
The Range of a Vector Measure with Values in a Montel Space. 145-147 - Paul Young:
Speed-Ups by Changing the Order in which Sets are Enumerated. 148-156 - Shair Ahmad:
Strong Attraction and Classification of Certain Continuous Flows. 157-163 - David Pager:
On Two-Way, Two-Tape Automata. 164-167 - Aïda B. Paalman-de Miranda:
A Note on W-Groups. 168-171 - Alfred V. Aho, Jeffrey D. Ullman:
Characterizations and Extensions of Pushdown Translations. 172-192
Volume 5, Number 3, 1971
- Hsin Chu:
On Semigroups in a Non-Compact Transformation Group. 193-200 - Meir Smorodinsky:
A Partition on a Bernoulli Shift which is not Weakly Bernoulli. 201-203 - Ivo Marek:
Approximations of the Principal Eigenelements in K-Positive Non-Selfadjoint Eigenvalue Problems. 204-215 - Seymour Ginsburg, John E. Hopcroft:
Images of AFL under Certain Families of Homomorphisms. 216-227 - Michael Sears:
The Automorphisms of the Shift Dynamical System are Relatively Sparse. 228-231 - Juris Hartmanis:
Computational Complexity of Random Acess Stored Program Machines. 232-245 - Claus-Peter Schnorr:
A Unified Approach to the Definition of Random Sequences. 246-258 - Ralph McKenzie, Jan Mycielski, David Thompson:
On Boolean Functions and Connected Sets. 259-270 - Oscar H. Ibarra:
Characterizations of Transductions Defined by Abstract Families of Transducers. 271-281 - Preston C. Hammer, Richard M. Jones:
Connected Sets: Bases and Metrics. 282-288
Volume 5, Number 4, 1971
- Otomar Hájek:
Limit Points which are not Sequentially Attainable. 289-291 - Anatole Beck:
Upper Semi-Continuous Decompositions of an Are. 292-294 - Roger C. McCann:
Cycle Periods of Perturbed Dynamical Systems. 295-298 - Nelson G. Markley:
Lifting Dynamical Properties. 299-305 - Raymond T. Yeh:
Some Structural Properties of Generalized Automata and Algebras. 306-318 - Usha Sachdeva:
On Category of Mixing in Infinite Measure Spaces. 319-330 - Ephraim P. Glinert:
On Restricted Turing Computability. 331-343 - Zoran R. Pop-Stojanovic:
Decomposition of Banach-Valued Quasimartingales. 344-348 - Otomar Hájek:
Identification of Control Systems by Performance. 349-352 - Mihajlo D. Mesarovic:
Controllability of General Systems. 353-364 - Karl E. Petersen:
Extension of Minimal Transformation Groups. 365-375 - Larry King:
Types of Isomorphisms of Transformation Groups. 376-382
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.