1996
DOI: 10.5109/13454
|View full text |Cite
|
Sign up to set email alerts
|

Transition Diagrams of Finite Cellular Automata

Abstract: This paper provides some simple recursive formulas generating tran sition diagrams of finite cellular automata with triplet local transition functions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

1998
1998
2005
2005

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Kumamoto and Nohmi (in preparation) analysed behaviors of integral affine transition systems, and showed that the transition diagrams of integral affine transition systems are the cartesian product of a system whose nodes are all on a limit cycle and a system having a fixed point. Lee and Kawahara (1996) presented tree expressions and their product formula, and got the result that transition diagram of some cellular automata can be represented by the cartesian product of transition diagrams of cellular automata with smaller cells. But their tree expressions can represent only transition systems with a fixed point and their product formula is limited on transition systems such that they have a fixed point * Faculty of Mathematics , Kyushu University 33, Fukuoka 812-8581 Japan.…”
Section: Introductionmentioning
confidence: 99%
“…Kumamoto and Nohmi (in preparation) analysed behaviors of integral affine transition systems, and showed that the transition diagrams of integral affine transition systems are the cartesian product of a system whose nodes are all on a limit cycle and a system having a fixed point. Lee and Kawahara (1996) presented tree expressions and their product formula, and got the result that transition diagram of some cellular automata can be represented by the cartesian product of transition diagrams of cellular automata with smaller cells. But their tree expressions can represent only transition systems with a fixed point and their product formula is limited on transition systems such that they have a fixed point * Faculty of Mathematics , Kyushu University 33, Fukuoka 812-8581 Japan.…”
Section: Introductionmentioning
confidence: 99%
“…Sato(1996aSato( ,1996bSato( ,1997Sato( ,1998 and Inokuchi(1996Inokuchi( ,1998Inokuchi( ,2000 investigated behaviors of 1-D cellular automata with triplet local transition rules and showed that the numbers of limit cycles and transient lengths obey simple rules like Fibonacci sequence. Furthermore, Lee and Kawahara(1996), and Inokuchi and Kawahara(1999) investigated transition diagrams of cellular automata and make an attempt to representing them by algebraic formulas called tree expressions.…”
Section: Introductionmentioning
confidence: 99%
“…Sato (1996) investigated behaviors of nonlinear cellular automata with rule 27. Lee and Kawahara (1996) investigated transition diagrams of 1dimensional cellular automata and proved that transition diagrams of a cellular au tomaton can be represented by the cartesian product of transition diagrams of smaller cellular automata. Shingai (1978) showed that the period length of limit cycles of cel lular automata with a threshold transition rule is 4 or less.…”
Section: Introductionmentioning
confidence: 99%