The following pages link to Chrystopher L. Nehaniv (Q494060):
Displayed 50 items.
- Length of polynomials over finite groups (Q494061) (← links)
- An assertion concerning functionally complete algebras and NP-completeness (Q955041) (← links)
- Linear analysis of genetic algorithms (Q1276251) (← links)
- Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. (Q1401334) (← links)
- (Q1575733) (redirect page) (← links)
- On complete systems of automata (Q1575734) (← links)
- (Q1899161) (redirect page) (← links)
- Subsemigroups and complexity via the presentation lemma (Q1899162) (← links)
- From relation to emulation: The covering lemma for transformation semigroups (Q1916148) (← links)
- SgpDec: Cascade (De)Compositions of Finite Transformation Semigroups and Permutation Groups (Q2879101) (← links)
- (Q2909007) (← links)
- Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions (Q2955779) (← links)
- HOLONOMY EMBEDDING OF ARBITRARY STABLE SEMIGROUPS (Q3043637) (← links)
- On Straight Words and Minimal Permutators in Finite Transformation Semigroups (Q3073628) (← links)
- (Q3077201) (← links)
- (Q3123644) (← links)
- Philosophy of Computation (Q3295749) (← links)
- BIOMICS: a Theory of Interaction Computing (Q3295752) (← links)
- ALGEBRAIC CONNECTIVITY (Q3363701) (← links)
- (Q3365316) (← links)
- (Q4217591) (← links)
- (Q4227133) (← links)
- (Q4236975) (← links)
- (Q4246564) (← links)
- (Q4263906) (← links)
- (Q4263913) (← links)
- (Q4269398) (← links)
- (Q4375728) (← links)
- (Q4421559) (← links)
- (Q4421738) (← links)
- (Q4421797) (← links)
- (Q4527162) (← links)
- The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (Q4596405) (← links)
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK (Q4658708) (← links)
- Algebraic Theory of Automata Networks (Q4677770) (← links)
- LIKE ME?- MEASURES OF CORRESPONDENCE AND IMITATION (Q4781319) (← links)
- MONOIDS AND GROUPS ACTING ON TREES: CHARACTERIZATIONS, GLUING, AND APPLICATIONS OF THE DEPTH PRESERVING ACTIONS (Q4852668) (← links)
- (Q4937898) (← links)
- (Q5429967) (← links)
- Representations of Space and Time in the Maximization of Information Flow in the Perception-Action Loop (Q5440975) (← links)
- Implementation and Application of Automata (Q5463996) (← links)
- (Q5475613) (← links)
- Stochastic Algorithms: Foundations and Applications (Q5493362) (← links)
- Cascade Product of Permutation Groups (Q5500191) (← links)
- Subgroup Chains and Lagrange Coordinatizations of Finite Permutation Groups (Q6216504) (← links)
- Compact Notation for Finite Transformations (Q6242447) (← links)
- Green's ${\mathcal J}$-classes and Subduction Classes in Finite Transformation Semigroups (Q6248192) (← links)
- Computational Holonomy Decomposition of Transformation Semigroups (Q6264859) (← links)
- Exploring Tetris as a Transformation Semigroup (Q6339015) (← links)
- Algebraic Structure and Complexity of Bootstrap Percolation with External Inputs (Q6341096) (← links)