Substitutions, Finite Automata and Number Systems : General and Mathematical Physics
スポンサーリンク
概要
- 論文の詳細を見る
Recently, nonperiodic deterministic physical systems modeled on substitutional sequences generated by morphisms from A into A*, A being a finite alphabet, have been studied extensively. For morphisms A→A^k, the resulting substitutional sequences (uniform tag sequences) have been known to be k-automatic. Here, the tag sequences are generalized, and all substitutional sequences are shown to be automatic in a certain sense.
- 理論物理学刊行会の論文
- 1992-08-25
著者
-
Kolar M.
The Institute Of Physical And Chemical Research (riken)
-
Kolar M
The Institute Of Physics And Chemical Research (riken)
関連論文
- Substitutions, Finite Automata and Number Systems : General and Mathematical Physics
- Use of Power-series Division in Multivariate Polynomial Arithmetic