Bisimulation Finiteness of Pushdown Systems Is Elementary
Formal Languages and Automata Theory
2020-05-14 v1 Logic in Computer Science
Abstract
We show that in case a pushdown system is bisimulation equivalent to a finite system, there is already a bisimulation equivalent finite system whose size is elementarily bounded in the description size of the pushdown system. As a consequence we obtain that it is elementarily decidable if a given pushdown system is bisimulation equivalent to some finite system. This improves a previously best-known ACKERMANN upper bound for this problem.
Cite
@article{arxiv.2005.06285,
title = {Bisimulation Finiteness of Pushdown Systems Is Elementary},
author = {Stefan Göller and Paweł Parys},
journal= {arXiv preprint arXiv:2005.06285},
year = {2020}
}