scientific article; zbMATH DE number 3307591
From MaRDI portal
Publication:5588674
zbMATH Open0193.32801MaRDI QIDQ5588674FDOQ5588674
Publication date: 1969
Title of this publication is not available (Why is that?)
Cited In (61)
- Canonical realization of general time systems
- On a relation between algebraic programs and Turing machines
- Significance arithmetic: The probability of carrying
- A lower bound on computational complexity given by revelation mechanisms
- Minimality of an automaton cascade decomposition for learning system environments
- Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function
- Confusion in the Garden of Eden
- On the transformation semigroups of finite automata
- An automaton decomposition for learning system environments
- Direct or cascade product of pushdown automata
- Toward a viable, self-reproducing universal computer
- Algebraic structures in linear systems theory
- Adjoint machines, state-behavior machines, and duality
- A CATEGORY OF FUZZY AUTOMATA
- Periodicity in generations of automata
- On universal computer-constructors
- Input-output parametric models for non-linear systems Part I: deterministic non-linear systems
- Pure grammars and pure languages†
- Theoretical foundations of planning and navigation for autonomous robots
- Semi-edges, reflections and Coxeter groups
- Realization is universal
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- On topological machines
- Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
- Finite automata and S-R models
- Recursiveness of monotonic array grammars and a hierarchy of array languages
- THE DECOMPOSITION OF TOLERANCE AUTOMATA
- 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 numerical analysis of two point boundary value problem algorithms
- Coproducts and decomposable machines
- COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
- A mode of decomposition of regular languages
- Title not available (Why is that?)
- Real-time language recognition by one-dimensional cellular automata
- On the computational power of totalistic cellular automata
- Degrees of computational complexity
- Finite stochastic automata with variable transition probabilities
- A study of algebraic structures and logics based on categories of rough sets
- The dynamics of symmetric nets
- Foreground automata
- Walkwise and admissible mappings between digraphs
- Locally testable languages
- Lattice valued relations and automata
- On the sequential nature of functions
- Statistical mechanics of cellular automata
- On Goedel speed-up and succinctness of language representations
- A contribution to the methodology of biomathematics: Information science approach to biomathematics. I
- In some curved spaces, one can solve NP-hard problems in polynomial time
- Sequential and jumping machines and their relation to computers
- Sexually reproducing cellular automata
- Approximation in a continuous model of computing
- Systematic approach to reduction and minimization in automata and system theory
- A decomposition theorem for probabilistic transition systems
- ROUGH FINITE-STATE AUTOMATA
- AUTOMATED ALGORITHM FINDING
- Financial laws as algebraic automata
- COST AUTOMATA, OPTIMALITY AND TOLERANCE
- Title not available (Why is that?)
- AN AUTOMATON WITH BRAIN‐LIKE PROPERTIES
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5588674)
