ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 314, Issues 1-2, 25 February 2004, Pages 251-279
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (395 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2003.12.020    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Some properties of Ising automata

Jia-Yan YaoE-mail The Corresponding Author

Department of Mathematics, Nonlinear Science Center, Wuhan University, Wuhan 430072, People's Republic of China

Received 15 July 2003; 
revised 17 November 2003; 
accepted 1 December 2003;
Communicated by Z. Ésik 
Available online 9 January 2004.

Purchase the full-text article



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


Theoretical Computer Science
Volume 314, Issues 1-2, 25 February 2004, Pages 251-279
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.