scientific article; zbMATH DE number 3307591

Cited in

(62)

scientific article; zbMATH DE number 3315217 (Why is no real title available?)
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
Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function
Minimality of an automaton cascade decomposition for learning system environments
On the transformation semigroups of finite automata
Confusion in the Garden of Eden
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
On universal computer-constructors
Periodicity in generations of automata
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
Another approach to the equivalence of measure-many one-way quantum finite automata and its application
Realization is universal
State machines for large scale computer software and systems
SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
On topological machines
Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets
ROUGH FINITE-STATE AUTOMATA
Finite automata and S-R models
Recursiveness of monotonic array grammars and a hierarchy of array languages
THE DECOMPOSITION OF TOLERANCE AUTOMATA
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)
Coproducts and decomposable machines
AUTOMATED ALGORITHM FINDING
Financial laws as algebraic automata
A mode of decomposition of regular languages
COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
scientific article; zbMATH DE number 3757710 (Why is no real title available?)
COST AUTOMATA, OPTIMALITY AND TOLERANCE
Real-time language recognition by one-dimensional cellular automata
On the computational power of totalistic cellular automata
The dynamics of symmetric nets
Degrees of computational complexity
Finite stochastic automata with variable transition probabilities
Foreground automata
Walkwise and admissible mappings between digraphs
scientific article; zbMATH DE number 3571535 (Why is no real title available?)
A study of algebraic structures and logics based on categories of rough sets
Lattice valued relations and automata
AN AUTOMATON WITH BRAIN‐LIKE PROPERTIES
Locally testable languages
On the sequential nature of functions
On Goedel speed-up and succinctness of language representations
Statistical mechanics of cellular automata
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

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)