منابع مشابه
Quasi-Linear Cellular Automata
Simulating a cellular automaton (CA) for t time-steps into the future requires t serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted efficiently, in serial time O(t) or O(log t) in parallel. In this paper, we generalize this by looki...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملLinear Cellular Automata and de Bruijn Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiau-tomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram's question about the growth rates of the minimal ...
متن کاملLinear Cellular Automata and Fischer Automata
We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blow-up. These cellular automata have Hamming distance 1 to a permutation automaton. Moreover, the corresponding minimal Fischer automata as well as the minimal DFAs have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1609