The following pages link to Pedro P. B. de Oliveira (Q272768):
Displaying 22 items.
- Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
- Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates (Q1755339) (← links)
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules (Q2207952) (← links)
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update (Q2215009) (← links)
- A fully operational framework for handling cellular automata templates (Q2325179) (← links)
- (Q2811212) (← links)
- Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem (Q2811954) (← links)
- Conceptual Connections around Density Determination in Cellular Automata (Q2851297) (← links)
- (Q2998125) (← links)
- Partial Reversibility of One-Dimensional Cellular Automata (Q3186479) (← links)
- (Q3521750) (← links)
- (Q3589605) (← links)
- (Q4467029) (← links)
- Inferring the Limit Behavior of Some Elementary Cellular Automata (Q4599770) (← links)
- (Q4803445) (← links)
- Computing Modulo-n by Composing Cellular Automata Rules (Q4976415) (← links)
- (Q4986309) (← links)
- (Q5010156) (← links)
- (Q5010393) (← links)
- Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem (Q5500623) (← links)
- A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update (Q6084238) (← links)
- Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations (Q6151157) (← links)
