Complexity Results on Register Pushdown Automata
Formal Languages and Automata Theory
2019-10-24 v1 Computational Complexity
Abstract
Register pushdown automata (RPDA) is an extension of classical pushdown automata to handle data values in a restricted way. RPDA attracts attention as a model of a query language for structured documents with data values. The membership and emptiness problems for RPDA are known to be EXPTIME-complete. This paper shows the membership problem becomes PSPACE-complete and NP-complete for nondecreasing and growing RPDA, respectively, while the emptiness problem remains EXPTIME-complete for these subclasses.
Keywords
Cite
@article{arxiv.1910.10357,
title = {Complexity Results on Register Pushdown Automata},
author = {Ryoma Senda and Yoshiaki Takata and Hiroyuki Seki},
journal= {arXiv preprint arXiv:1910.10357},
year = {2019}
}
Comments
Proceedings of the Third Workshop on Software Foundations for Data Interoperability (SFDI2019+), October 28, 2019, Fukuoka, Japan