Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-01-29
Computer Science
Formal Languages and Automata Theory
Scientific paper
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc) providing several formal tools allowing to classify cellular automata.
Delorme Marianne
Mazoyer Jacques
Ollinger Nicolas
Theyssier Guillaume
No associations
LandOfFree
Bulking II: Classifications of Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bulking II: Classifications of Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bulking II: Classifications of Cellular Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-251918