%0 Generic %1 balasubramanian2021adaptive %A Balasubramanian, A. R. %A Thejaswini, K. S. %D 2021 %K informal %T Adaptive Synchronisation of Pushdown Automata %U https://arxiv.org/abs/2102.06897 %X We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The observer would then like to decide if it is possible to bring the automaton from any state into some predetermined state by giving inputs to it in an adaptive manner, i.e., the next input letter to be given can depend on how the contents of the stack changed after the current input letter. We show that for non-deterministic pushdown automata, this problem is 2-EXPTIME-complete and for deterministic pushdown automata, we show EXPTIME-completeness. To prove the lower bounds, we first introduce (different variants of) subset-synchronisation and show that these problems are polynomial-time equivalent with the adaptive synchronisation problem. We then prove hardness results for the subset-synchronisation problems. For proving the upper bounds, we consider the problem of deciding if a given alternating pushdown system has an accepting run with at most k leaves and we provide an n^O(k^2) time algorithm for this problem.

@misc{balasubramanian2021adaptive, abstract = {We introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The observer would then like to decide if it is possible to bring the automaton from any state into some predetermined state by giving inputs to it in an adaptive manner, i.e., the next input letter to be given can depend on how the contents of the stack changed after the current input letter. We show that for non-deterministic pushdown automata, this problem is 2-EXPTIME-complete and for deterministic pushdown automata, we show EXPTIME-completeness. To prove the lower bounds, we first introduce (different variants of) subset-synchronisation and show that these problems are polynomial-time equivalent with the adaptive synchronisation problem. We then prove hardness results for the subset-synchronisation problems. For proving the upper bounds, we consider the problem of deciding if a given alternating pushdown system has an accepting run with at most k leaves and we provide an n^O(k^2) time algorithm for this problem. }, added-at = {2021-02-22T15:13:40.000+0100}, archiveprefix = {arXiv}, author = {Balasubramanian, A. R. and Thejaswini, K. S.}, biburl = {https://www.bibsonomy.org/bibtex/2dc7ff41480f78930ff1f048df68793fb/paves}, eprint = {2102.06897}, interhash = {b788d6dfe415837253bcfb0def89bca7}, intrahash = {dc7ff41480f78930ff1f048df68793fb}, keywords = {informal}, primaryclass = {cs.FL}, timestamp = {2023-09-24T19:41:11.000+0200}, title = {Adaptive Synchronisation of Pushdown Automata}, url = {https://arxiv.org/abs/2102.06897}, year = 2021 }