An Infinite Automaton Characterization of Double Exponential Time
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.
978-3-540-87530-7
33-48
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2008
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro
(2008)
An Infinite Automaton Characterization of Double Exponential Time.
CSL, Bertinoro, Italy.
16 - 19 Sep 2008.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
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.
Text
fulltext.pdf
- Version of Record
More information
Published date: 2008
Additional Information:
Event Dates: September 16-19, 2008
Venue - Dates:
CSL, Bertinoro, Italy, 2008-09-16 - 2008-09-19
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272460
URI: http://eprints.soton.ac.uk/id/eprint/272460
ISBN: 978-3-540-87530-7
PURE UUID: 3c2db79d-3360-41b5-aa4d-8646b01c9230
Catalogue record
Date deposited: 13 Jun 2011 14:06
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
P. Madhusudan
Author:
Gennaro Parlato
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics