Abstract
We study the computational capacity of self-verifying cellular automata with an emphasis on one-way information flow (\(\text {SVOCA}\)). A self-verifying device is a nondeterministic device where each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give either the answer yes or no, and the answers given must not be contradictory. Realtime \(\text {SVOCA}\) are strictly more powerful than realtime deterministic one-way cellular automata. They can be sped-up from lineartime to realtime and are capable to simulate any lineartime computation of deterministic two-way CA. Closure and decidability properties are considered as well.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call