Some properties of Ising automata

DOI10.1016/j.tcs.2003.12.020zbMath1070.68079OpenAlexW1974749824MaRDI QIDQ1884924

Jia-Yan Yao

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.020

zbMATH Keywords

Finite automataAutomatic sequencesIsing automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items

Prime automata do not exist ⋮ Moore machines duality

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata in number theory
• Quasicrystal Ising chain and automata theory
• Opacity of an automaton. Application to inhomogeneous Ising chain
• Equivalence of topological Markov shifts
• Opacity of finite automata
• \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
• Characterization of Glushkov automata
• Minimizing subsequential transducers: a survey.
• Opacity of a finite automaton, method of calculation and the Ising chain
• Symbolic Dynamics and its Applications
• The spectrum of dynamical systems arising from substitutions of constant length
• Beitrag zur Theorie des Ferromagnetismus