scientific article; zbMATH DE number 3307591

Cited in

(61)

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

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)