Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-03-12
Computer Science
Formal Languages and Automata Theory
35 pages, 33 figures
Scientific paper
In this paper, we construct a new weakly universal cellular automaton on the
ternary heptagrid. The previous result, obtained by the same author and Y. Song
required six states only. This time, the number of states is four. This is the
best result up to date for cellular automata in the hyperbolic plane.
No associations
LandOfFree
A new universal cellular automaton on the ternary heptagrid 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 A new universal cellular automaton on the ternary heptagrid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new universal cellular automaton on the ternary heptagrid will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36017