An Infinite Automaton Characterization of Double Exponential Time

Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of initial and final states. Infinite-state automata have gained recent interest due to a remarkable result by Morvan and Stirling, which shows that automata with transitions defined using rational rewriting precisely capture context-sensitive (NLINSPACE) languages. In this paper, we show that infinite automata defined using a form of multi-stack rewriting precisely defines double exponential time (more precisely, 2ETIME, the class of problems solvable in 22O(n) time). The salient aspect of this characterization is that the automata have no ostensible limits on time nor space, and neither direction of containment with respect to 2ETIME is obvious. In this sense, the result captures the complexity class qualitatively, by restricting the power of rewriting.

• Type: Conference
• Year: 2008
• Where: CSL
• Authors: Salvatore La Torre, P. Madhusudan, Gennaro Parlato
• Keywords: Automated Reasoning, CSL 2008, Infinite Automata, Infinite Number, Infinite-state Automata