Some properties of Ising automata

Authors:
Jia-Yan Yao
Affiliations:
Department of Mathematics, Nonlinear Science Center, Wuhun University, Wuhan 430072, People's Republic of China
Venue:
Theoretical Computer Science
Year:
2004

Citing 8
Cited 0

An introduction to the Ising model

American Mathematical Monthly
Opacités des automates finis

Discrete Mathematics
Characterization of Glushkov automata

Theoretical Computer Science
PSPACE-complete problems for subgroups of free groups and inverse finite automata

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Opacity of a finite automaton, method of calculation and the Ising chain

Discrete Applied Mathematics
Minimizing subsequential transducers: a survey

Theoretical Computer Science
Composition of Automata

Proceedings of the 2nd Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	5.23

Visualization

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 aud 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.