arXiv:2611.20999 · v1
How Can Size, Ceiling, and Time Bounds Affect the Complexity of Nonuniform Automata Families?
摘要
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.
作者备注:(A4 size, 10pt, 34 pages, 6 figures) This paper is a modified, extended version of arxiv.org/abs/2606.26685v1 (2026). This paper is an extended and corrected version of a preliminary report (with a slightly different title) appeared in the Proceedings of the 16th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2026), EPTCS vol. 446, pp. 105-120, 2026