A short proof on the cyclic behaviour of multithreshold symmetric automata

DOI10.1016/S0019-9958(81)90199-6zbMath0503.68038OpenAlexW1994909536MaRDI QIDQ3969869

Servet Martínez, Eric Goles Chacc

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(81)90199-6

zbMATH Keywords

finite state machinebinary symmetric threshold 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)

Related Items (3)

Cycles of cooperation and free-riding in social systems ⋮ Dynamics of positive automata networks ⋮ On an application of convexity to discrete systems

This page was built for publication: A short proof on the cyclic behaviour of multithreshold symmetric automata