arXiv · 2611.20999
How Can Size, Ceiling, and Time Bounds Affect the Complexity of Nonuniform Automata Families?
Abstract
In the past literature, families of two-way finite automata and pushdown automata having limited resource-bounded complexity have been studied in direct connection to (mainstream) space-bounded complexity classes equipped with Karp-Lipton style advice of limited size when all inputs given to the automata have bounded length. We acknowledge three major factors--size, ceiling, and time--of such families, which have a significant impact on the computational/descriptional complexity of finite and pushdown automata families, where the "size" refers to the (stack-)state complexity, the "ceiling" refers to the maximum input length, and the "time" refers to the execution time of underlying automata. In this line of study, we further explore these effects caused by different sizes and ceilings. We exploit automata-based reducibility and translatability to space-bounded advised Turing machines and auxiliary automata.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tomoyuki Yamakami. 2026-11-16. How Can Size, Ceiling, and Time Bounds Affect the Complexity of Nonuniform Automata Families?. https://searcharxiv.com/abs/2611.20999
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.