Copyright © 2003 Elsevier B.V. All rights reserved.
Some properties of Ising automata
Received 15 July 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this work, we shall present some arithmetical and topological properties of Ising automata. More precisely, we shall study many different notions, such as faithful and strictly faithful automata, factor and product automata, irreducible and weakly irreducible automata, prime automata, homogeneous automata, minimal automata, invertible automata, etc., and discuss their related properties. We shall also define and study three different topologies over the set of all minimal automata, and discuss the topological closure property of automatic sequences. As application, we shall use the obtained results to give a somewhat detailed analysis of Ising automata.
Author Keywords: Finite automata; Automatic sequences; Ising automata
Mathematical subject codes: primary 18B20; 11B85; secondary 68Q45; 68Q70







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

is not necessarily uniform, but rather satisfies the analogue of an algebraic equation. We show that these sequences coincide with 



