AI Chat AI Image Generator AI Video Text to Speech

Complexity Results on Register Pushdown Automata

10/23/2019

∙

by Ryoma Senda, et al.

∙

∙

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.

Ryoma Senda
2 publications
Yoshiaki Takata
3 publications
Hiroyuki Seki
5 publications

page 1

page 2

page 3

page 4

research

∙ 07/26/2017

Composition problems for braids: Membership, Identity and Freeness

In this paper we investigate the decidability and complexity of problems...

0 Sang-Ki Ko, et al. ∙

research

∙ 05/13/2020

Bisimilarity in fresh-register automata

Register automata are a basic model of computation over infinite alphabe...

0 Andrzej S. Murawski, et al. ∙

research

∙ 05/19/2017

Foundations of Declarative Data Analysis Using Limit Datalog Programs

Motivated by applications in declarative data analysis, we study Datalog...

0 Mark Kaminski, et al. ∙

research

∙ 09/04/2019

On the k-synchronizability of systems

In this paper, we work on the notion of k-synchronizability: a system is...

0 Cinzia Di Giusto, et al. ∙

research

∙ 06/28/2018

Reachability in timed automata with diagonal constraints

We consider the reachability problem for timed automata having diagonal ...

0 Paul Gastin, et al. ∙

research

∙ 07/03/2020

Active learning of timed automata with unobservable resets

Active learning of timed languages is concerned with the inference of ti...

0 Léo Henry, et al. ∙

research

∙ 06/26/2019

The impatient collector

In the coupon collector problem with n items, the collector needs a rand...

0 Anis Amri, et al. ∙