scientific article; zbMATH DE number 3307591
From MaRDI portal
Publication:5588674
zbMath0193.32801MaRDI QIDQ5588674
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (60)
Approximation in a continuous model of computing ⋮ In some curved spaces, one can solve NP-hard problems in polynomial time ⋮ A CATEGORY OF FUZZY AUTOMATA ⋮ Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function ⋮ An automaton decomposition for learning system environments ⋮ Unnamed Item ⋮ On Goedel speed-up and succinctness of language representations ⋮ A lower bound on computational complexity given by revelation mechanisms ⋮ On the computational power of totalistic cellular automata ⋮ Theoretical foundations of planning and navigation for autonomous robots ⋮ AN AUTOMATON WITH BRAIN‐LIKE PROPERTIES ⋮ Financial laws as algebraic automata ⋮ Realization is universal ⋮ Periodicity in generations of automata ⋮ A numerical analysis of two point boundary value problem algorithms ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Unnamed Item ⋮ A decomposition theorem for probabilistic transition systems ⋮ Unnamed Item ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Foreground automata ⋮ ROUGH FINITE-STATE AUTOMATA ⋮ A mode of decomposition of regular languages ⋮ AUTOMATED ALGORITHM FINDING ⋮ 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 ⋮ COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY ⋮ 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 ⋮ Toward a viable, self-reproducing universal computer ⋮ On a relation between algebraic programs and Turing machines ⋮ Significance arithmetic: The probability of carrying ⋮ THE DECOMPOSITION OF TOLERANCE AUTOMATA ⋮ Pure grammars and pure languages† ⋮ 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) ⋮ Statistical mechanics of cellular automata ⋮ A contribution to the methodology of biomathematics: Information science approach to biomathematics. I ⋮ Confusion in the Garden of Eden ⋮ Locally testable languages ⋮ Sequential and jumping machines and their relation to computers ⋮ Degrees of computational complexity ⋮ COST AUTOMATA, OPTIMALITY AND TOLERANCE ⋮ Sexually reproducing cellular automata ⋮ Finite stochastic automata with variable transition probabilities ⋮ On universal computer-constructors ⋮ Real-time language recognition by one-dimensional cellular automata ⋮ On the transformation semigroups of finite automata ⋮ Coproducts and decomposable machines ⋮ Walkwise and admissible mappings between digraphs ⋮ The dynamics of symmetric nets ⋮ Semi-edges, reflections and Coxeter groups ⋮ Lattice valued relations and automata ⋮ Input-output parametric models for non-linear systems Part I: deterministic non-linear systems ⋮ Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets ⋮ Minimality of an automaton cascade decomposition for learning system environments
This page was built for publication:
