On the power of deep pushdown stacks

The original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fulltext.pdf

Detalles Bibliográficos
Autores: Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X, Stewart, Iain A.
Tipo de recurso: artículo
Fecha de publicación:2009
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/7964
Acceso en línea:https://hdl.handle.net/2117/7964
https://dx.doi.org/10.1007/s00236-009-0103-x
Access Level:acceso abierto
Palabra clave:Computational complexity
Computer algorithms
Complexitat computacional
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
id ES_7ef02bfeb2d4f581a5ec1a5e6f80bb50
oai_identifier_str oai:upcommons.upc.edu:2117/7964
network_acronym_str ES
network_name_str España
repository_id_str
spelling On the power of deep pushdown stacksArratia Quesada, Argimiro Alejandro|||0000-0003-1551-420XStewart, Iain A.Computational complexityComputer algorithmsComplexitat computacionalAlgorismes computacionalsÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitatThe original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fulltext.pdfInspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDSs, based around assignments, while-loops and non-deterministic guessing but with access to a deep pushdown stack which, apart from having the usual push and pop instructions, also has deep-push instructions which allow elements to be pushed to stack locations deep within the stack. We syntactically define sub-classes of NPSDSs by restricting the occurrences of pops, pushes and deep-pushes and capture the complexity classes NP and PSPACE. Furthermore, we show that all problems accepted by program schemes of NPSDSs are in EXPTIME.Peer Reviewed20092009-11-0120102010-07-01journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/7964https://dx.doi.org/10.1007/s00236-009-0103-xreponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/79642026-05-27T15:37:01Z
dc.title.none.fl_str_mv On the power of deep pushdown stacks
title On the power of deep pushdown stacks
spellingShingle On the power of deep pushdown stacks
Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
Computational complexity
Computer algorithms
Complexitat computacional
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
title_short On the power of deep pushdown stacks
title_full On the power of deep pushdown stacks
title_fullStr On the power of deep pushdown stacks
title_full_unstemmed On the power of deep pushdown stacks
title_sort On the power of deep pushdown stacks
dc.creator.none.fl_str_mv Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
Stewart, Iain A.
author Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
author_facet Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
Stewart, Iain A.
author_role author
author2 Stewart, Iain A.
author2_role author
dc.subject.none.fl_str_mv Computational complexity
Computer algorithms
Complexitat computacional
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
topic Computational complexity
Computer algorithms
Complexitat computacional
Algorismes computacionals
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
description The original publication is available at http://www.springerlink.com/content/y46h6501746506p0/fulltext.pdf
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-11-01
2010
2010-07-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/7964
https://dx.doi.org/10.1007/s00236-009-0103-x
url https://hdl.handle.net/2117/7964
https://dx.doi.org/10.1007/s00236-009-0103-x
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411787156226048
score 15.300724

Similares en LA Referencia