Alex Borello

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we present a parallel speed-up of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head finite automata and is characterized by the fact that the trajectory of the heads only depends on the length of the input word. While the original k-head finite automaton works in(More)
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterised by having its heads moving only forward, on a trajectory that only depends on the length of the input. While the original finite automaton(More)
  • 1