Decidable and computational properties of cellular automata

Pietro Di Lena · AMS Dottorato Institutional Doctoral Theses Repository (University of Bologna) · 2007

& *" " $ " *" " $ "' $ $ ' 2 " $ " " 4 "'"" " " $ &" ' &$ $ 4 $* $ * " " * & ; " " $ $* "$ "'"" 1 2 *" $ "" " & ' ": $ " $ & * ** & $ $" $ " "> 4 ** & """ & $ 2 "" 4 " *" 5 $ $* "* " !" "" # " " $ ' "'"" $ ' ?%= (@ 5 $ ' ?%-= @ : $" """ ' "'"" # ' < 3 " 2 $ $" ; ' ?@$ $ " $" $ $ " $ $ 4 "" " # " &$ " $" " : $ "" A " B "" " " $ $' " ' " # : """ 2 ?+-= +0= +7@ : ?@= " $ " "" # 2 " $ 3 * "* $* "" 2 ' " 5 " $ * $ " # " "" $ $ < $* $ " """ "" $ " < '" " $ $* "* " !" "" # " " $ ' "'"" $ ' ?%= (@ $ ' ?%-= @ $ " & ; & /3 '= 2 " " "" # " A" ++B $ " $ $ " " &" : 1 %= & * 5 # 2 &$ 1 %= & * 2 $ 4 ' 1'" $ ' : = 1 " %= %% %( & * & " *' /3 '= 2 " " "" # "

Read the paper · More papers on PaperTik