TY - UNPD
A1 - Malcher, Andreas
T1 - On one-way cellular automata with a fixed number of cells
N2 - We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of regular languages. A kC-OCA can be algorithmically converted to a deterministic finite automaton (DFA). The blow-up in the number of states is bounded by a polynomial of degree k. We can exhibit a family of unary languages which shows that this upper bound is tight in order of magnitude. We then study upper and lower bounds for the trade-off when converting DFAs to kC-OCAs. We show that there are regular languages where the use of kC-OCAs cannot reduce the number of states when compared to DFAs. We then investigate trade-offs between kC-OCAs with different numbers of cells and finally treat the problem of minimizing a given kC-OCA.
T3 - Frankfurter Informatik-Berichte - 03, 1
KW - Zellularer Automat
Y1 - 2003
UR - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/7185
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hebis:30-71706
SN - 1616-9107
PB - Johann Wolfgang Goethe-Univ., Fachbereich Biologie und Informatik, Inst. für Informatik
CY - Frankfurt am Main
ER -