Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro
An Infinite Automaton Characterization of Double Exponential Time
At CSL, Italy.
16 - 19 Sep 2008.
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.
Conference or Workshop Item
||Event Dates: September 16-19, 2008
|Venue - Dates:
||CSL, Italy, 2008-09-16 - 2008-09-19
||Electronic & Software Systems
||13 Jun 2011 14:06
||17 Apr 2017 17:44
|Further Information:||Google Scholar|
Actions (login required)