Probabilistic variants of depth-k storage automata

Develop and analyze probabilistic variants of nondeterministic depth-k storage automata (k-sna’s), and characterize their computational power and structural properties, possibly including auxiliary versions under polynomial time and logarithmic work space bounds.

Background

Prior work has explored probabilistic limited automata (a different but related memory-restricted model). The present paper suggests extending such probabilistic analysis to storage automata with depth-bounded rewriting.

This open question calls for formulating probabilistic k-sna’s and investigating their distinct capabilities and limitations.

References

For future research, we wish to list eight key open questions associated with aux-$k$-sna's and $k$-cascading circuits. The probabilistic variant of Hibbard's limited automata was discussed extensively in . It is of importance to look into a similar probabilistic variant of $k$-sna's and explore its characteristic features for a better understanding of storage automata.

— Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits (2412.09186 - Yamakami, 12 Dec 2024) in Section 7 (Brief Discussions and Future Research Directions), Item 4