Publication:5588674
From MaRDI portal
zbMath0193.32801MaRDI QIDQ5588674
Publication date: 1969
Related Items
Financial laws as algebraic automata, ROUGH FINITE-STATE AUTOMATA, Unnamed Item, AN AUTOMATON WITH BRAIN‐LIKE PROPERTIES, Realization is universal, On Goedel speed-up and succinctness of language representations, A decomposition theorem for probabilistic transition systems, Lattice valued relations and automata, In some curved spaces, one can solve NP-hard problems in polynomial time, Toward a viable, self-reproducing universal computer, The dynamics of symmetric nets, Approximation in a continuous model of computing, Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function, An automaton decomposition for learning system environments, A numerical analysis of two point boundary value problem algorithms, Foreground automata, A mode of decomposition of regular languages, Adjoint machines, state-behavior machines, and duality, Finite automata and S-R models, On the sequential nature of functions, Systematic approach to reduction and minimization in automata and system theory, Canonical realization of general time systems, Direct or cascade product of pushdown automata, On topological machines, Recursiveness of monotonic array grammars and a hierarchy of array languages, On a relation between algebraic programs and Turing machines, Significance arithmetic: The probability of carrying, Minimality of an automaton cascade decomposition for learning system environments, On the transformation semigroups of finite automata, Coproducts and decomposable machines, Walkwise and admissible mappings between digraphs, Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets, A lower bound on computational complexity given by revelation mechanisms, Algebraic structures in linear systems theory, Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series), A contribution to the methodology of biomathematics: Information science approach to biomathematics. I, Locally testable languages, Sequential and jumping machines and their relation to computers, Degrees of computational complexity, Sexually reproducing cellular automata, Finite stochastic automata with variable transition probabilities, On universal computer-constructors, Real-time language recognition by one-dimensional cellular automata, Confusion in the Garden of Eden, Semi-edges, reflections and Coxeter groups, Statistical mechanics of cellular automata, Input-output parametric models for non-linear systems Part I: deterministic non-linear systems, On the computational power of totalistic cellular automata, Theoretical foundations of planning and navigation for autonomous robots, Unnamed Item, THE DECOMPOSITION OF TOLERANCE AUTOMATA, Pure grammars and pure languages†, COST AUTOMATA, OPTIMALITY AND TOLERANCE, A CATEGORY OF FUZZY AUTOMATA, Unnamed Item, Periodicity in generations of automata, SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY, AUTOMATED ALGORITHM FINDING, COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
