The convergence of symmetric threshold automata

DOI10.1016/S0019-9958(81)90208-4MaRDI QIDQ3969871zbMATH OpenFDO

Authors J. Olivos A., Eric Goles

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

zbMATH Keywords

binary symmetric threshold automatonfirst state machinesymmetric multithreshold automaton

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cited in

(13)

• Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function
• Computing with truly asynchronous threshold logic networks
• Neural networks as systems for recognizing patterns
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Dynamics of positive automata networks
• A computational study of \(f\)-reversible processes on graphs
• Convergence of a subgradient method for computing the bound norm of matrices
• The predecessor-existence problem for \(k\)-reversible processes
• On the computational power of discrete Hopfield nets
• The complexity of the asynchronous prediction of the majority automata
• Decreasing energy functions as a tool for studying threshold networks
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Neural networks and complexity theory

This page was built for publication: The convergence of symmetric threshold automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3969871)