Jun 26, 2022 · We show that the membership and emptiness problems for RCFG are EXPTIME-complete and also show the membership problem becomes PSPACE-complete ...
Mar 31, 2022 · Register context-free grammars (RCFG) and register pushdown automata (RPDA) were proposed in [10] as extensions of classical context-free.
We show that the membership and emptiness problems for RCFG are EXPTIME-complete and also show the membership problem becomes PSPACE-complete and NP-complete ...
This paper investigates the computational complexity of the basic decision problems for RCFG and RTA. We show that the membership and emptiness problems for ...
Complexity Results on Register Context-Free Grammars and ...
www.semanticscholar.org › paper › Com...
This paper first introduces register type as a finite representation of the register contents and shows some properties of RCFG, and extends register type ...
Missing: formalisms. | Show results with:formalisms.
Complexity results on register context-free grammars and related formalisms. R Senda, Y Takata, H Seki. Theoretical Computer Science 923, 99-125, 2022. 2, 2022.
Oct 23, 2019 · Seki, Complexity results on register context-free grammars and related formalisms, submitted to an international journal.
Complexity results on register context-free grammars and related formalisms ... Register context-free grammars (RCFG), register pushdown automata (RPDA) ...
Complexity results on register context-free grammars and related formalisms ... Register context-free grammars (RCFG), register pushdown ...
Register context-free grammars (RCFG) is an extension of context-free grammars to handle data values in a restricted way. In RCFG, a certain number of data ...