An infinite automaton characterization of double exponential time

Salvatore La Torre, P. Madhusudan, Gennaro Parlato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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.

Original languageEnglish (US)
Title of host publicationComputer Science Logic - 22nd International Workshop, CSL 2008 - 17th Annual Conference of the EACSL, Proceedings
Pages33-48
Number of pages16
DOIs
StatePublished - Dec 25 2008
Event22nd International Workshop on Computer Science Logic, CSL 2008, and 17th Annual Conference of the European Association for Computer Science Logic, EACSL - Bertinoro, Italy
Duration: Sep 16 2008Sep 19 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5213 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Workshop on Computer Science Logic, CSL 2008, and 17th Annual Conference of the European Association for Computer Science Logic, EACSL
Country/TerritoryItaly
CityBertinoro
Period9/16/089/19/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An infinite automaton characterization of double exponential time'. Together they form a unique fingerprint.

Cite this