The following pages link to (Q5588674):
Displayed 50 items.
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- On Goedel speed-up and succinctness of language representations (Q594584) (← links)
- A decomposition theorem for probabilistic transition systems (Q673117) (← links)
- Lattice valued relations and automata (Q799110) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- Toward a viable, self-reproducing universal computer (Q992326) (← links)
- The dynamics of symmetric nets (Q1053636) (← links)
- Approximation in a continuous model of computing (Q1082816) (← links)
- Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function (Q1104051) (← links)
- An automaton decomposition for learning system environments (Q1104102) (← links)
- A numerical analysis of two point boundary value problem algorithms (Q1157116) (← links)
- Foreground automata (Q1201881) (← links)
- A mode of decomposition of regular languages (Q1218282) (← links)
- Adjoint machines, state-behavior machines, and duality (Q1224156) (← links)
- Finite automata and S-R models (Q1230763) (← links)
- On the sequential nature of functions (Q1232180) (← links)
- Systematic approach to reduction and minimization in automata and system theory (Q1232389) (← links)
- Canonical realization of general time systems (Q1237031) (← links)
- Direct or cascade product of pushdown automata (Q1238631) (← links)
- On topological machines (Q1239134) (← links)
- Recursiveness of monotonic array grammars and a hierarchy of array languages (Q1239610) (← links)
- On a relation between algebraic programs and Turing machines (Q1242675) (← links)
- Significance arithmetic: The probability of carrying (Q1243504) (← links)
- Minimality of an automaton cascade decomposition for learning system environments (Q1608319) (← links)
- On the transformation semigroups of finite automata (Q1836302) (← links)
- Coproducts and decomposable machines (Q1843530) (← links)
- Walkwise and admissible mappings between digraphs (Q1845747) (← links)
- Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets (Q1867785) (← links)
- A lower bound on computational complexity given by revelation mechanisms (Q1920945) (← links)
- Algebraic structures in linear systems theory (Q2542991) (← links)
- 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) (Q2547595) (← links)
- A contribution to the methodology of biomathematics: Information science approach to biomathematics. I (Q2549276) (← links)
- Locally testable languages (Q2554236) (← links)
- Sequential and jumping machines and their relation to computers (Q2554954) (← links)
- Degrees of computational complexity (Q2557123) (← links)
- Sexually reproducing cellular automata (Q2561202) (← links)
- Finite stochastic automata with variable transition probabilities (Q2561841) (← links)
- On universal computer-constructors (Q2562768) (← links)
- Real-time language recognition by one-dimensional cellular automata (Q2563020) (← links)
- Confusion in the Garden of Eden (Q3213159) (← links)
- Semi-edges, reflections and Coxeter groups (Q3433734) (← links)
- Statistical mechanics of cellular automata (Q3646415) (← links)
- Input-output parametric models for non-linear systems Part I: deterministic non-linear systems (Q3688237) (← links)
- On the computational power of totalistic cellular automata (Q3763596) (← links)
- Theoretical foundations of planning and navigation for autonomous robots (Q3770353) (← links)
- THE DECOMPOSITION OF TOLERANCE AUTOMATA (Q3886872) (← links)
- Pure grammars and pure languages† (Q3902533) (← links)
- COST AUTOMATA, OPTIMALITY AND TOLERANCE (Q3920654) (← links)
- (Q3940851) (← links)
- A CATEGORY OF FUZZY AUTOMATA (Q3986731) (← links)