Bisimulation Finiteness of Pushdown Systems Is Elementary

DOI10.1145/3373718.3394827OpenAlexW3030551326MaRDI QIDQ5145660

Paweł Parys, Stefan Göller

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.06285

zbMATH Keywords

pushdown automatabisimulation equivalenceelementarybisimulation finiteness

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

This page was built for publication: Bisimulation Finiteness of Pushdown Systems Is Elementary